fact: Definition equiv_bool_terminate : forall t1 t2 : term, {v : bool | forall k : nat, (size t1) <= k -> forall def : term -> term -> bool, iter (term -> term -> bool) k equiv_bool_F def t1 t2 = v}.
imports: Coq(Bool Peano List PeanoNat) CoLoR(closure more_list equiv_list list_permut dickson) Coq(Relations Wellfounded Arith Wf_nat Recdef Program Morphisms Lia) CoLoR(term_spec term decidable_set ordered_set NatCompat)