theory of multiple relocation completed

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / multiple / lifts_lift.ma

diff --git a/matita/matita/contribs/lambdadelta/basic_2/multiple/lifts_lift.ma b/matita/matita/contribs/lambdadelta/basic_2/multiple/lifts_lift.ma
deleted file mode 100644 (file)
index 2c693ba..0000000
--- a/matita/matita/contribs/lambdadelta/basic_2/multiple/lifts_lift.ma
+++ /dev/null
@@ -1,63 +0,0 @@
-(**************************************************************************)
-(*       ___                                                              *)
-(*      ||M||                                                             *)
-(*      ||A||       A project by Andrea Asperti                           *)
-(*      ||T||                                                             *)
-(*      ||I||       Developers:                                           *)
-(*      ||T||         The HELM team.                                      *)
-(*      ||A||         http://helm.cs.unibo.it                             *)
-(*      \   /                                                             *)
-(*       \ /        This file is distributed under the terms of the       *)
-(*        v         GNU General Public License Version 2                  *)
-(*                                                                        *)
-(**************************************************************************)
-
-include "ground_2/ynat/ynat_max.ma".
-include "basic_2/substitution/lift_lift.ma".
-include "basic_2/multiple/mr2_minus.ma".
-include "basic_2/multiple/lifts.ma".
-
-(* GENERIC TERM RELOCATION **************************************************)
-
-(* Properties concerning basic term relocation ******************************)
-
-(* Basic_1: was: lift1_xhg (right to left) *)
-lemma lifts_lift_trans_le: ∀T1,T,cs. ⬆*[cs] T1 ≡ T → ∀T2. ⬆[0, 1] T ≡ T2 →
-                           ∃∃T0. ⬆[0, 1] T1 ≡ T0 & ⬆*[cs + 1] T0 ≡ T2.
-#T1 #T #cs #H elim H -T1 -T -cs
-[ /2 width=3 by lifts_nil, ex2_intro/
-| #T1 #T3 #T #cs #l #m #HT13 #_ #IHT13 #T2 #HT2
-  elim (IHT13 … HT2) -T #T #HT3 #HT2
-  elim (lift_trans_le … HT13 … HT3) -T3 /3 width=5 by lifts_cons, ex2_intro/
-]
-qed-.
-
-(* Basic_1: was: lift1_free (right to left) *)
-lemma lifts_lift_trans: ∀cs,i,i0. @⦃i, cs⦄ ≡ i0 →
-                        ∀cs0. cs + 1 ▭ i + 1 ≡ cs0 + 1 →
-                        ∀T1,T0. ⬆*[cs0] T1 ≡ T0 →
-                        ∀T2. ⬆[O, i0 + 1] T0 ≡ T2 →
-                        ∃∃T. ⬆[0, i + 1] T1 ≡ T & ⬆*[cs] T ≡ T2.
-#cs elim cs -cs
-[ #i #x #H1 #cs0 #H2 #T1 #T0 #HT10 #T2
-  <(at_inv_nil … H1) -x #HT02
-  lapply (minuss_inv_nil1 … H2) -H2 #H
-  >(pluss_inv_nil2 … H) in HT10; -cs0 #H
-  >(lifts_inv_nil … H) -T1 /2 width=3 by lifts_nil, ex2_intro/
-| #l #m #cs #IHcs #i #i0 #H1 #cs0 #H2 #T1 #T0 #HT10 #T2 #HT02
-  elim (at_inv_cons … H1) -H1 * #Hil #Hi0
-  [ elim (minuss_inv_cons1_lt … H2) -H2 /2 width=1 by ylt_succ/ #cs1 #Hcs1
-    <yplus_inj >yplus_SO2 >yplus_SO2 >yminus_succ #H
-    elim (pluss_inv_cons2 … H) -H #cs2 #H1 #H2 destruct
-    elim (lifts_inv_cons … HT10) -HT10 #T #HT1 #HT0
-    elim (IHcs … Hi0 … Hcs1 … HT0 … HT02) -IHcs -Hi0 -Hcs1 -T0 #T0 #HT0 #HT02
-    elim (lift_trans_le … HT1 … HT0) -T /2 width=1 by/ #T #HT1
-    <yminus_plus2 <yplus_inj >yplus_SO2 >ymax_pre_sn
-    /3 width=5 by lifts_cons, ex2_intro, ylt_fwd_le_succ1/
-  | >commutative_plus in Hi0; #Hi0
-    lapply (minuss_inv_cons1_ge … H2 ?) -H2 /2 width=1 by yle_succ/ <associative_plus #Hcs0
-    elim (IHcs … Hi0 … Hcs0 … HT10 … HT02) -IHcs -Hi0 -Hcs0 -T0 #T0 #HT0 #HT02
-    elim (lift_split … HT0 l (i+1)) -HT0 /3 width=5 by lifts_cons, yle_succ, yle_pred_sn, ex2_intro/
-  ]
-]
-qed-.