]> matita.cs.unibo.it Git - helm.git/blob - matita/matita/contribs/lambda_delta/basic_2/reducibility/ltpr.ma
- support for pointwise extensions of a term relation started ...
[helm.git] / matita / matita / contribs / lambda_delta / basic_2 / reducibility / ltpr.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/grammar/lenv_px.ma".
16 include "basic_2/reducibility/tpr.ma".
17
18 (* CONTEXT-FREE PARALLEL REDUCTION ON LOCAL ENVIRONMENTS ********************)
19
20 definition ltpr: relation lenv ≝ lpx tpr.
21
22 interpretation
23   "context-free parallel reduction (environment)"
24   'PRed L1 L2 = (ltpr L1 L2).
25
26 (* Basic properties *********************************************************)
27
28 lemma ltpr_refl: reflexive … ltpr.
29 /2 width=1/ qed.
30
31 (* Basic inversion lemmas ***************************************************)
32
33 (* Basic_1: was: wcpr0_gen_sort *)
34 lemma ltpr_inv_atom1: ∀L2. ⋆ ➡ L2 → L2 = ⋆.
35 /2 width=2 by lpx_inv_atom1/ qed-.
36
37 (* Basic_1: was: wcpr0_gen_head *)
38 lemma ltpr_inv_pair1: ∀K1,I,V1,L2. K1. ⓑ{I} V1 ➡ L2 →
39                       ∃∃K2,V2. K1 ➡ K2 & V1 ➡ V2 & L2 = K2. ⓑ{I} V2.
40 /2 width=1 by lpx_inv_pair1/ qed-.
41
42 lemma ltpr_inv_atom2: ∀L1. L1 ➡ ⋆ → L1 = ⋆.
43 /2 width=2 by lpx_inv_atom2/ qed-.
44
45 lemma ltpr_inv_pair2: ∀L1,K2,I,V2. L1 ➡ K2. ⓑ{I} V2 →
46                       ∃∃K1,V1. K1 ➡ K2 & V1 ➡ V2 & L1 = K1. ⓑ{I} V1.
47 /2 width=1 by lpx_inv_pair2/ qed-.
48
49 (* Basic forward lemmas *****************************************************)
50
51 lemma ltpr_fwd_length: ∀L1,L2. L1 ➡ L2 → |L1| = |L2|.
52 /2 width=2 by lpx_fwd_length/ qed-.
53
54 (* Basic_1: removed theorems 2: wcpr0_getl wcpr0_getl_back *)