proposition: Fact nat2bt_mono n m : n <= m -> nat2bt n ⊆ nat2bt m.
proof: Proof. induction 1 as [ | m Hm IHm ]; auto. apply bti_trans with (1 := IHm). apply bt_transitive_incl; auto. simpl; btm simpl. 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)