(* GENERIC EXTENSION ON REFERRED ENTRIES OF A CONTEXT-SENSITIVE REALTION ****)
+(* Advanced properties ******************************************************)
+
+lemma lfxs_pair_sn_split: ∀R1,R2. (∀L. reflexive … (R1 L)) → (∀L. reflexive … (R2 L)) →
+ lexs_frees_confluent … R1 cfull →
+ ∀L1,L2,V. L1 ⦻*[R1, V] L2 → ∀I,T.
+ ∃∃L. L1 ⦻*[R1, ②{I}V.T] L & L ⦻*[R2, V] L2.
+#R1 #R2 #HR1 #HR2 #HR #L1 #L2 #V * #f #Hf #HL12 * [ #p ] #I #T
+[ elim (frees_total L1 (ⓑ{p,I}V.T)) #g #Hg
+ elim (frees_inv_bind … Hg) #y1 #y2 #H #_ #Hy
+| elim (frees_total L1 (ⓕ{I}V.T)) #g #Hg
+ elim (frees_inv_flat … Hg) #y1 #y2 #H #_ #Hy
+]
+lapply(frees_mono … H … Hf) -H #H1
+lapply (sor_eq_repl_back1 … Hy … H1) -y1 #Hy
+lapply (sor_inv_sle_sn … Hy) -y2 #Hfg
+elim (lexs_sle_split … HR1 HR2 … HL12 … Hfg) -HL12 #L #HL1 #HL2
+lapply (sle_lexs_trans … HL1 … Hfg) // #H
+elim (HR … Hf … H) -HR -Hf -H
+/4 width=7 by sle_lexs_trans, ex2_intro/
+qed-.
+
+lemma lfxs_flat_dx_split: ∀R1,R2. (∀L. reflexive … (R1 L)) → (∀L. reflexive … (R2 L)) →
+ lexs_frees_confluent … R1 cfull →
+ ∀L1,L2,T. L1 ⦻*[R1, T] L2 → ∀I,V.
+ ∃∃L. L1 ⦻*[R1, ⓕ{I}V.T] L & L ⦻*[R2, T] L2.
+#R1 #R2 #HR1 #HR2 #HR #L1 #L2 #T * #f #Hf #HL12 #I #V
+elim (frees_total L1 (ⓕ{I}V.T)) #g #Hg
+elim (frees_inv_flat … Hg) #y1 #y2 #_ #H #Hy
+lapply(frees_mono … H … Hf) -H #H2
+lapply (sor_eq_repl_back2 … Hy … H2) -y2 #Hy
+lapply (sor_inv_sle_dx … Hy) -y1 #Hfg
+elim (lexs_sle_split … HR1 HR2 … HL12 … Hfg) -HL12 #L #HL1 #HL2
+lapply (sle_lexs_trans … HL1 … Hfg) // #H
+elim (HR … Hf … H) -HR -Hf -H
+/4 width=7 by sle_lexs_trans, ex2_intro/
+qed-.
+
(* Main properties **********************************************************)
theorem lfxs_bind: ∀R,p,I,L1,L2,V1,V2,T.
#R #I #L1 #L2 #V #T * #f1 #HV #Hf1 * #f2 #HT #Hf2 elim (sor_isfin_ex f1 f2)
/3 width=7 by frees_fwd_isfin, frees_flat, lexs_join, ex2_intro/
qed.
-(*
-theorem lfxs_trans: ∀R. lexs_frees_confluent R cfull →
- ∀T. Transitive … (lfxs R T).
-#R #H1R #T #L1 #L * #f1 #Hf1 #HL1 #L2 * #f2 #Hf2 #HL2
-elim (H1R … Hf1 … HL1) #f #H0 #H1
-lapply (frees_mono … Hf2 … H0) -Hf2 -H0 #Hf2
-lapply (lexs_eq_repl_back … HL2 … Hf2) -f2 #HL2
-lapply (sle_lexs_trans … HL1 … H1) -HL1 // #Hl1
-@(ex2_intro … f)
-/4 width=7 by lreq_trans, lexs_eq_repl_back, ex2_intro/
-qed-.
-*)
-theorem lfxs_conf: ∀R. lexs_frees_confluent R cfull →
- R_confluent2_lfxs R R R R →
- ∀T. confluent … (lfxs R T).
-#R #H1R #H2R #T #L0 #L1 * #f1 #Hf1 #HL01 #L2 * #f #Hf #HL02
+theorem lfxs_conf: ∀R1,R2.
+ lexs_frees_confluent R1 cfull →
+ lexs_frees_confluent R2 cfull →
+ R_confluent2_lfxs R1 R2 R1 R2 →
+ ∀T. confluent2 … (lfxs R1 T) (lfxs R2 T).
+#R1 #R2 #HR1 #HR2 #HR12 #T #L0 #L1 * #f1 #Hf1 #HL01 #L2 * #f #Hf #HL02
lapply (frees_mono … Hf1 … Hf) -Hf1 #Hf12
lapply (lexs_eq_repl_back … HL01 … Hf12) -f1 #HL01
elim (lexs_conf … HL01 … HL02) /2 width=3 by ex2_intro/ [ | -HL01 -HL02 ]
[ #L #HL1 #HL2
- elim (H1R … Hf … HL01) -HL01 #f1 #Hf1 #H1
- elim (H1R … Hf … HL02) -HL02 #f2 #Hf2 #H2
+ elim (HR1 … Hf … HL01) -HL01 #f1 #Hf1 #H1
+ elim (HR2 … Hf … HL02) -HL02 #f2 #Hf2 #H2
lapply (sle_lexs_trans … HL1 … H1) // -HL1 -H1 #HL1
lapply (sle_lexs_trans … HL2 … H2) // -HL2 -H2 #HL2
/3 width=5 by ex2_intro/
elim (frees_drops_next … Hf … HLK0 … Hgf) -Hf -HLK0 -Hgf #g0 #Hg0 #H0
lapply (sle_lexs_trans … HK01 … H0) // -HK01 #HK01
lapply (sle_lexs_trans … HK02 … H0) // -HK02 #HK02
- elim (H2R … HV01 … HV02 K1 … K2) /2 width=3 by ex2_intro/
+ elim (HR12 … HV01 … HV02 K1 … K2) /2 width=3 by ex2_intro/
]
qed-.