fact: Fixpoint af_tree_iter (X:Type) (R : X -> X -> Prop) (decR : dec_rel R) (x:X) (accX : Acc R x) := match accX with | Acc_intro _ f => SUP (fun y => match decR x y with | left _ => ZT X | right Ry => af_tree_iter decR (f y Ry) end) end.
imports: Coq(Arith Relations Lia) Coq(FunctionalExtensionality)