]> matita.cs.unibo.it Git - helm.git/blob - matita/matita/contribs/lambdadelta/basic_2/reduction/ysc.ma
c6cc92643870fb8461a516e994dacd4f1e5d4024
[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / reduction / ysc.ma
1 (**************************************************************************)
2 (*       ___                                                              *)
3 (*      ||M||                                                             *)
4 (*      ||A||       A project by Andrea Asperti                           *)
5 (*      ||T||                                                             *)
6 (*      ||I||       Developers:                                           *)
7 (*      ||T||         The HELM team.                                      *)
8 (*      ||A||         http://helm.cs.unibo.it                             *)
9 (*      \   /                                                             *)
10 (*       \ /        This file is distributed under the terms of the       *)
11 (*        v         GNU General Public License Version 2                  *)
12 (*                                                                        *)
13 (**************************************************************************)
14
15 include "basic_2/notation/relations/btpredproper_8.ma".
16 include "basic_2/reduction/fpb.ma".
17
18 (* "BIG TREE" PROPER PARALLEL REDUCTION FOR CLOSURES ************************)
19
20 inductive ysc (h) (g) (G1) (L1) (T1): relation3 genv lenv term ≝
21 | ysc_fsup  : ∀G2,L2,T2. ⦃G1, L1, T1⦄ ⊃ ⦃G2, L2, T2⦄ → ysc h g G1 L1 T1 G2 L2 T2
22 | ysc_cpr   : ∀T2. ⦃G1, L1⦄ ⊢ T1 ➡ T2 → (T1 = T2 → ⊥) → ysc h g G1 L1 T1 G1 L1 T2
23 | ysc_ssta  : ∀T2,l. ⦃G1, L1⦄ ⊢ T1 ▪[h, g] l+1 → ⦃G1, L1⦄ ⊢ T1 •[h, g] T2 → ysc h g G1 L1 T1 G1 L1 T2
24 .
25
26 interpretation
27    "'big tree' proper parallel reduction (closure)"
28    'BTPRedProper h g G1 L1 T1 G2 L2 T2 = (ysc h g G1 L1 T1 G2 L2 T2).
29
30 (* Basic properties *********************************************************)
31
32 lemma ysc_fpb: ∀h,g,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ≻[h, g] ⦃G2, L2, T2⦄ →
33                ⦃G1, L1, T1⦄ ≽[h, g] ⦃G2, L2, T2⦄.
34 #h #g #G1 #G2 #L1 #L2 #T1 #T2 * -G2 -L2 -T2
35 /2 width=2 by fpb_fsup, fpb_cpr, fpb_ssta/
36 qed.
37
38 (* Inversion lemmas on "big tree" parallel reduction for closures ***********)
39
40 lemma fpb_inv_ysc: ∀h,g,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ≽[h, g] ⦃G2, L2, T2⦄ →
41                    ⦃G1, L1, T1⦄ ≻[h, g] ⦃G2, L2, T2⦄ ∨
42                    ∧∧ G1 = G2 & ⦃G1, L1⦄ ⊢ ➡ L2 & T1 = T2.
43 #h #g #G1 #G2 #L1 #L2 #T1 #T2 * -G2 -L2 -T2
44 /3 width=2 by and3_intro, or_introl, or_intror, ysc_fsup, ysc_ssta/
45 #T2 #HT12 elim (term_eq_dec T1 T2) #H destruct
46 /4 width=1 by and3_intro, or_introl, or_intror, ysc_cpr/
47 qed-.