proposition: Fact nat2bt_transitive n : bt_transitive (nat2bt n).
proof: Proof. induction n as [ | n IHn ]; simpl. + intros ? ?; btm simpl. + intros a b; btm simpl. intros H1 [ <- | H3 ]; right; auto. revert H1 H3; apply IHn. 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)