proposition: Fact hfs_card_transitive n : hfs_transitive (hfs_card n).
proof: Proof. unfold hfs_card. apply bt_hfs_transitive. intros ? ?. rewrite hfs_repr_bt_cls. apply nat2bt_transitive. Qed.
imports: List Arith Lia Max Wellfounded Setoid Eqdep_dec Bool Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.Shared.Libs.DLW.Wf(wf_finite wf_chains) Undecidability.FOL.TRAKHTENBROT(notations fol_ops membership btree)