proposition: Fact hfs_tc_incl t : t ⊆ hfs_tc t.
proof: Proof. unfold hfs_tc. intros x Hx. rewrite btm_repr_cls. apply bt_tc_incr; auto. 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)