(* *)
(**************************************************************************)
+include "basic_2/syntax/ceq_ext_ceq_ext.ma".
include "basic_2/relocation/lexs_lexs.ma".
-include "basic_2/relocation/lreq.ma".
(* RANGED EQUIVALENCE FOR LOCAL ENVIRONMENTS ********************************)
(* Main properties **********************************************************)
theorem lreq_trans: ∀f. Transitive … (lreq f).
-/2 width=3 by lexs_trans/ qed-.
+/3 width=5 by lexs_trans, ceq_ext_trans/ qed-.
theorem lreq_canc_sn: ∀f. left_cancellable … (lreq f).
/3 width=3 by lexs_canc_sn, lreq_trans, lreq_sym/ qed-.
/3 width=3 by lexs_canc_dx, lreq_trans, lreq_sym/ qed-.
theorem lreq_join: ∀f1,L1,L2. L1 ≡[f1] L2 → ∀f2. L1 ≡[f2] L2 →
- â\88\80f. f1 â\8b\93 f2 â\89¡ f → L1 ≡[f] L2.
+ â\88\80f. f1 â\8b\93 f2 â\89\98 f → L1 ≡[f] L2.
/2 width=5 by lexs_join/ qed-.
theorem lreq_meet: ∀f1,L1,L2. L1 ≡[f1] L2 → ∀f2. L1 ≡[f2] L2 →
- â\88\80f. f1 â\8b\92 f2 â\89¡ f → L1 ≡[f] L2.
+ â\88\80f. f1 â\8b\92 f2 â\89\98 f → L1 ≡[f] L2.
/2 width=5 by lexs_meet/ qed-.