(* *)
(**************************************************************************)
-include "basic_2/notation/relations/lazyeq_8.ma".
+include "basic_2/notation/relations/stareqsn_8.ma".
include "basic_2/syntax/genv.ma".
include "basic_2/static/lfdeq.ma".
(* DEGREE-BASED EQUIVALENCE FOR CLOSURES ON REFERRED ENTRIES ****************)
inductive ffdeq (h) (o) (G) (L1) (T): relation3 genv lenv term ≝
-| ffdeq_intro: â\88\80L2. L1 â\89¡[h, o, T] L2 → ffdeq h o G L1 T G L2 T
+| ffdeq_intro: â\88\80L2. L1 â\89\9b[h, o, T] L2 → ffdeq h o G L1 T G L2 T
.
interpretation
"degree-based equivalence on referred entries (closure)"
- 'LazyEq h o G1 L1 T1 G2 L2 T2 = (ffdeq h o G1 L1 T1 G2 L2 T2).
+ 'StarEqSn h o G1 L1 T1 G2 L2 T2 = (ffdeq h o G1 L1 T1 G2 L2 T2).
(* Basic properties *********************************************************)
(* Basic inversion lemmas ***************************************************)
-lemma ffdeq_inv_gen: â\88\80h,o,G1,G2,L1,L2,T1,T2. â¦\83G1, L1, T1â¦\84 â\89¡[h, o] ⦃G2, L2, T2⦄ →
- â\88§â\88§ G1 = G2 & L1 â\89¡[h, o, T1] L2 & T1 = T2.
+lemma ffdeq_inv_gen: â\88\80h,o,G1,G2,L1,L2,T1,T2. â¦\83G1, L1, T1â¦\84 â\89\9b[h, o] ⦃G2, L2, T2⦄ →
+ â\88§â\88§ G1 = G2 & L1 â\89\9b[h, o, T1] L2 & T1 = T2.
#h #o #G1 #G2 #L1 #L2 #T1 #T2 * -G2 -L2 -T2 /2 width=1 by and3_intro/
qed-.