proposition: Fact nat2bt_order_iso n m : nat2bt n ⊆ nat2bt m <-> n <= m.
proof: Proof. split; eauto. intros H. destruct (le_lt_dec m n); try lia. cut (n = m); try lia. apply nat2bt_inj, bti_equiv; eauto. Qed.
imports: List Arith Lia Max Wellfounded Setoid Eqdep_dec Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_decidable finite seteq) Undecidability.Shared.Libs.DLW.Vec(pos) Undecidability.Shared.Libs.DLW.Wf(wf_finite wf_chains) Undecidability.FOL.TRAKHTENBROT(notations fol_ops)