- advances in the theory of cofrees

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / computation / fpbu_fleq.ma

diff --git a/matita/matita/contribs/lambdadelta/basic_2/computation/fpbu_fleq.ma b/matita/matita/contribs/lambdadelta/basic_2/computation/fpbu_fleq.ma
index 566b8387280c37e6aa067a5dfe8b726a86278724..c4e1813a996279a849ce1a8b3f986c728b32d798 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/computation/fpbu_fleq.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/computation/fpbu_fleq.ma
@@ -20,16 +20,16 @@ include "basic_2/computation/fpbu_lleq.ma".
 
 (* Properties on lazy equivalence for closures ******************************)
 
-lemma fleq_fpbu_trans: â\88\80h,g,F1,F2,K1,K2,T1,T2. â¦\83F1, K1, T1â¦\84 â\8b\95[0] ⦃F2, K2, T2⦄ →
+lemma fleq_fpbu_trans: â\88\80h,g,F1,F2,K1,K2,T1,T2. â¦\83F1, K1, T1â¦\84 â\89¡[0] ⦃F2, K2, T2⦄ →
                        ∀G2,L2,U2. ⦃F2, K2, T2⦄ ≻[h, g] ⦃G2, L2, U2⦄ →
-                       â\88\83â\88\83G1,L1,U1. â¦\83F1, K1, T1â¦\84 â\89»[h, g] â¦\83G1, L1, U1â¦\84 & â¦\83G1, L1, U1â¦\84 â\8b\95[0] ⦃G2, L2, U2⦄.
+                       â\88\83â\88\83G1,L1,U1. â¦\83F1, K1, T1â¦\84 â\89»[h, g] â¦\83G1, L1, U1â¦\84 & â¦\83G1, L1, U1â¦\84 â\89¡[0] ⦃G2, L2, U2⦄.
 #h #g #F1 #F2 #K1 #K2 #T1 #T2 * -F2 -K2 -T2
 #K2 #HK12 #G2 #L2 #U2 #H12 elim (lleq_fpbu_trans … HK12 … H12) -K2
 /3 width=5 by fleq_intro, ex2_3_intro/
 qed-.
 
 lemma fpb_fpbu: ∀h,g,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ≽[h, g] ⦃G2, L2, T2⦄ →
-                â¦\83G1, L1, T1â¦\84 â\8b\95[0] ⦃G2, L2, T2⦄ ∨
+                â¦\83G1, L1, T1â¦\84 â\89¡[0] ⦃G2, L2, T2⦄ ∨
                 ⦃G1, L1, T1⦄ ≻[h, g] ⦃G2, L2, T2⦄.
 #h #g #G1 #G2 #L1 #L2 #T1 #T2 * -G2 -L2 -T2
 [ #G2 #L2 #T2 #H elim (fquq_inv_gen … H) -H
@@ -45,7 +45,7 @@ lemma fpb_fpbu: ∀h,g,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ≽[h, g] ⦃G2, L2,
 qed-.
 
 lemma fpbs_fpbu_sn: ∀h,g,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ≥[h, g] ⦃G2, L2, T2⦄ →
-                    â¦\83G1, L1, T1â¦\84 â\8b\95[0] ⦃G2, L2, T2⦄ ∨
+                    â¦\83G1, L1, T1â¦\84 â\89¡[0] ⦃G2, L2, T2⦄ ∨
                     ∃∃G,L,T. ⦃G1, L1, T1⦄ ≻[h, g] ⦃G, L, T⦄ & ⦃G, L, T⦄ ≥[h, g] ⦃G2, L2, T2⦄.
 (* ALTERNATIVE PROOF
 #h #g #G1 #G2 #L1 #L2 #T1 #T2 #H @(fpbs_ind_dx … H) -G1 -L1 -T1