matita/matita/contribs/lambdadelta/basic_2A/multiple/llpx_sn_alt.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_2A/multiple/frees.ma".
  16 include "basic_2A/multiple/llpx_sn_alt_rec.ma".
  17
  18 (* LAZY SN POINTWISE EXTENSION OF A CONTEXT-SENSITIVE REALTION FOR TERMS ****)
  19
  20 (* alternative definition of llpx_sn (not recursive) *)
  21 definition llpx_sn_alt: relation3 lenv term term → relation4 ynat term lenv lenv ≝
  22                         λR,l,T,L1,L2. |L1| = |L2| ∧
  23                         (∀I1,I2,K1,K2,V1,V2,i. l ≤ yinj i → L1 ⊢ i ϵ 𝐅*[l]⦃T⦄ →
  24                            ⬇[i] L1 ≡ K1.ⓑ{I1}V1 → ⬇[i] L2 ≡ K2.ⓑ{I2}V2 →
  25                            I1 = I2 ∧ R K1 V1 V2
  26                         ).
  27
  28 (* Main properties **********************************************************)
  29
  30 theorem llpx_sn_llpx_sn_alt: ∀R,T,L1,L2,l. llpx_sn R l T L1 L2 → llpx_sn_alt R l T L1 L2.
  31 #R #U #L1 @(f2_ind … rfw … L1 U) -L1 -U
  32 #x #IHx #L1 #U #Hx #L2 #l #H elim (llpx_sn_inv_alt_r … H) -H
  33 #HL12 #IHU @conj //
  34 #I1 #I2 #K1 #K2 #V1 #V2 #i #Hli #H #HLK1 #HLK2 elim (frees_inv … H) -H
  35 [ -x #HnU elim (IHU … HnU HLK1 HLK2) -IHU -HnU -HLK1 -HLK2 /2 width=1 by conj/
  36 | * #J1 #K10 #W10 #j #Hlj #Hji #HnU #HLK10 #HnW10 destruct
  37   lapply (drop_fwd_drop2 … HLK10) #H
  38   lapply (drop_conf_ge … H … HLK1 ?) -H /2 width=1 by lt_to_le/ <minus_plus #HK10
  39   elim (drop_O1_lt (Ⓕ) L2 j) [2: <HL12 /2 width=5 by drop_fwd_length_lt2/ ] #J2 #K20 #W20 #HLK20
  40   lapply (drop_fwd_drop2 … HLK20) #H
  41   lapply (drop_conf_ge … H … HLK2 ?) -H /2 width=1 by lt_to_le/ <minus_plus #HK20
  42   elim (IHx K10 W10 … K20 0) -IHx -HL12 /3 width=6 by drop_fwd_rfw/
  43   elim (IHU … HnU HLK10 HLK20) -IHU -HnU -HLK10 -HLK20 //
  44 ]
  45 qed.
  46
  47 theorem llpx_sn_alt_inv_llpx_sn: ∀R,T,L1,L2,l. llpx_sn_alt R l T L1 L2 → llpx_sn R l T L1 L2.
  48 #R #U #L1 @(f2_ind … rfw … L1 U) -L1 -U
  49 #x #IHx #L1 #U #Hx #L2 #l * #HL12 #IHU @llpx_sn_intro_alt_r //
  50 #I1 #I2 #K1 #K2 #V1 #V2 #i #Hli #HnU #HLK1 #HLK2 destruct
  51 elim (IHU … HLK1 HLK2) /3 width=2 by frees_eq/
  52 #H #HV12 @and3_intro // @IHx -IHx /3 width=6 by drop_fwd_rfw/
  53 lapply (drop_fwd_drop2 … HLK1) #H1
  54 lapply (drop_fwd_drop2 … HLK2) -HLK2 #H2
  55 @conj [ @(drop_fwd_length_eq1 … H1 H2) // ] -HL12
  56 #Z1 #Z2 #Y1 #Y2 #X1 #X2 #j #_
  57 >(minus_plus_m_m j (i+1)) in ⊢ (%→?); >commutative_plus <minus_plus
  58 #HnV1 #HKY1 #HKY2 (**) (* full auto too slow *)
  59 lapply (drop_trans_ge … H1 … HKY1 ?) -H1 -HKY1 // #HLY1
  60 lapply (drop_trans_ge … H2 … HKY2 ?) -H2 -HKY2 // #HLY2
  61 /4 width=14 by frees_be, yle_plus_dx2_trans, yle_succ_dx/
  62 qed-.