proposition: Fact bt_hfs_transitive t : hfs_transitive t <-> bt_transitive (repr t).
proof: Proof. split. + intros H u v G. do 2 rewrite <- btm_cls_repr. apply H. rewrite btm_cls_repr, hfs_repr_bt_cls; auto. + intros H u v G. do 2 rewrite hfs_mem_repr. apply H; 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)