X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fbasic_2%2Freduction%2Ffpbc.ma;h=cb391a6c932c96dc276ab03eacff43390a182698;hb=7ad8c044ab33ea0f2aebb1c40fa20340d7f2f3eb;hp=a2b62d2a12eb464a58b747d3e1a3c1dc3cf2f508;hpb=a5b0e6d1efb9b5126cc1d72d954edc9a5e630981;p=helm.git

diff --git a/matita/matita/contribs/lambdadelta/basic_2/reduction/fpbc.ma b/matita/matita/contribs/lambdadelta/basic_2/reduction/fpbc.ma
index a2b62d2a1..cb391a6c9 100644
--- a/matita/matita/contribs/lambdadelta/basic_2/reduction/fpbc.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/reduction/fpbc.ma
@@ -13,14 +13,14 @@
 (**************************************************************************)
 
 include "basic_2/notation/relations/btpredproper_8.ma".
-include "basic_2/relocation/fsupq_alt.ma".
+include "basic_2/relocation/fquq_alt.ma".
 include "basic_2/reduction/fpb.ma".
 
 (* "BIG TREE" PROPER PARALLEL REDUCTION FOR CLOSURES ************************)
 
 inductive fpbc (h) (g) (G1) (L1) (T1): relation3 genv lenv term ≝
-| fpbc_fsup  : ∀G2,L2,T2. ⦃G1, L1, T1⦄ ⊃ ⦃G2, L2, T2⦄ → fpbc h g G1 L1 T1 G2 L2 T2
-| fpbc_cpx   : ∀T2. ⦃G1, L1⦄ ⊢ T1 ➡[h, g] T2 → (T1 = T2 → ⊥) → fpbc h g G1 L1 T1 G1 L1 T2
+| fpbc_fqu: ∀G2,L2,T2. ⦃G1, L1, T1⦄ ⊃ ⦃G2, L2, T2⦄ → fpbc h g G1 L1 T1 G2 L2 T2
+| fpbc_cpx: ∀T2. ⦃G1, L1⦄ ⊢ T1 ➡[h, g] T2 → (T1 = T2 → ⊥) → fpbc h g G1 L1 T1 G1 L1 T2
 .
 
 interpretation
@@ -30,24 +30,24 @@ interpretation
 (* Basic properties *********************************************************)
 
 lemma fpbc_fpb: ∀h,g,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ≻[h, g] ⦃G2, L2, T2⦄ →
-               ⦃G1, L1, T1⦄ ≽[h, g] ⦃G2, L2, T2⦄.
+                ⦃G1, L1, T1⦄ ≽[h, g] ⦃G2, L2, T2⦄.
 #h #g #G1 #G2 #L1 #L2 #T1 #T2 * -G2 -L2 -T2
-/3 width=1 by fpb_fsupq, fpb_cpx, fsup_fsupq/
+/3 width=1 by fpb_fquq, fpb_cpx, fqu_fquq/
 qed.
 
 lemma cpr_fpbc: ∀h,g,G,L,T1,T2. ⦃G, L⦄ ⊢ T1 ➡ T2 → (T1 = T2 → ⊥) →
-               ⦃G, L, T1⦄ ≻[h, g] ⦃G, L, T2⦄.
+                ⦃G, L, T1⦄ ≻[h, g] ⦃G, L, T2⦄.
 /3 width=1 by fpbc_cpx, cpr_cpx/ qed.
 
 (* Inversion lemmas on "big tree" parallel reduction for closures ***********)
 
 lemma fpb_inv_fpbc: ∀h,g,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ≽[h, g] ⦃G2, L2, T2⦄ →
-                   ⦃G1, L1, T1⦄ ≻[h, g] ⦃G2, L2, T2⦄ ∨
-                   ∧∧ G1 = G2 & ⦃G1, L1⦄ ⊢ ➡[h, g] L2 & T1 = T2.
+                    ⦃G1, L1, T1⦄ ≻[h, g] ⦃G2, L2, T2⦄ ∨
+                    ∧∧ G1 = G2 & ⦃G1, L1⦄ ⊢ ➡[h, g] L2 & T1 = T2.
 #h #g #G1 #G2 #L1 #L2 #T1 #T2 * -G2 -L2 -T2
 /3 width=1 by and3_intro, or_intror/
-[ #G2 #L2 #T2 #H elim (fsupq_inv_gen … H) -H [| * ]
-  /3 width=1 by fpbc_fsup, and3_intro, or_introl, or_intror/
+[ #G2 #L2 #T2 #H elim (fquq_inv_gen … H) -H [| * ]
+  /3 width=1 by fpbc_fqu, and3_intro, or_introl, or_intror/
 | #T2 #HT12 elim (term_eq_dec T1 T2) #H destruct
   /4 width=1 by and3_intro, or_introl, or_intror, fpbc_cpx/
 ]