]> matita.cs.unibo.it Git - helm.git/blob - matita/matita/contribs/lambdadelta/basic_2/rt_computation/lfpxs_lpxs.ma
- lpx and lpxs restored to prove equivalene between lfpxs and lpxs + lfeq
[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / rt_computation / lfpxs_lpxs.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/i_static/tc_lfxs_lex.ma".
16 include "basic_2/rt_transition/lfpx_frees.ma".
17 include "basic_2/rt_computation/lpxs.ma".
18 include "basic_2/rt_computation/lfpxs.ma".
19
20 (* UNCOUNTED PARALLEL RT-COMPUTATION FOR LOCAL ENV.S ON REFERRED ENTRIES ****)
21
22 (* Properties with uncounted parallel rt-computation for local environments *)
23
24 lemma lfpxs_lpxs_lfeq: ∀h,G,L1,L. ⦃G, L1⦄ ⊢ ⬈*[h] L →
25                        ∀L2,T. L ≡[T] L2 → ⦃G, L1⦄ ⊢ ⬈*[h, T] L2.
26 /2 width=3 by tc_lfxs_lex_lfeq/ qed.
27
28 (* Inversion lemmas with uncounted parallel rt-computation for local envs ***)
29
30 lemma lpx_cpxs_ext_trans: ∀h,G. s_rs_transitive_isid cfull (cpx_ext h G).
31 #H1 #H2 #H3 #H4 #H5 #H6 #H7 #H8 #H9 #H10
32
33
34 lemma tc_lfxs_inv_lex_lfeq: ∀h,G,L1,L2,T. ⦃G, L1⦄ ⊢ ⬈*[h, T] L2 →
35                             ∃∃L. ⦃G, L1⦄ ⊢ ⬈*[h] L & L ≡[T] L2.
36 #h #G @tc_lfxs_inv_lex_lfeq //
37 [ @lfpx_frees_conf
38 | @lpx_cpxs_ext_trans