X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground_2%2Frelocation%2Fmr2_minus.ma;h=b721754b6ac088698bf547f24094b22292e18bc4;hp=b68e549591b981aaa5bd55b6630aa18d87bf6f63;hb=a77d0bd6a04e94f765d329d47b37d9e04d349b14;hpb=b598b37379baabef24ae511596be7f740cbb0c2e

diff --git a/matita/matita/contribs/lambdadelta/ground_2/relocation/mr2_minus.ma b/matita/matita/contribs/lambdadelta/ground_2/relocation/mr2_minus.ma
index b68e54959..b721754b6 100644
--- a/matita/matita/contribs/lambdadelta/ground_2/relocation/mr2_minus.ma
+++ b/matita/matita/contribs/lambdadelta/ground_2/relocation/mr2_minus.ma
@@ -20,9 +20,9 @@ include "ground_2/relocation/mr2.ma".
 inductive minuss: nat → relation mr2 ≝
 | minuss_nil: ∀i. minuss i (◊) (◊)
 | minuss_lt : ∀cs1,cs2,l,m,i. i < l → minuss i cs1 cs2 →
-              minuss i ({l, m} @ cs1) ({l - i, m} @ cs2)
+              minuss i ({l, m} ⨮ cs1) ({l - i, m} ⨮ cs2)
 | minuss_ge : ∀cs1,cs2,l,m,i. l ≤ i → minuss (m + i) cs1 cs2 →
-              minuss i ({l, m} @ cs1) cs2
+              minuss i ({l, m} ⨮ cs1) cs2
 .
 
 interpretation "minus (multiple relocation with pairs)"
@@ -42,10 +42,10 @@ lemma minuss_inv_nil1: ∀cs2,i. ◊ ▭ i ≘ cs2 → cs2 = ◊.
 /2 width=4 by minuss_inv_nil1_aux/ qed-.
 
 fact minuss_inv_cons1_aux: ∀cs1,cs2,i. cs1 ▭ i ≘ cs2 →
-                           ∀l,m,cs. cs1 = {l, m} @ cs →
+                           ∀l,m,cs. cs1 = {l, m} ⨮ cs →
                            l ≤ i ∧ cs ▭ m + i ≘ cs2 ∨
                            ∃∃cs0. i < l & cs ▭ i ≘ cs0 &
-                                   cs2 = {l - i, m} @ cs0.
+                                   cs2 = {l - i, m} ⨮ cs0.
 #cs1 #cs2 #i * -cs1 -cs2 -i
 [ #i #l #m #cs #H destruct
 | #cs1 #cs #l1 #m1 #i1 #Hil1 #Hcs #l2 #m2 #cs2 #H destruct /3 width=3 by ex3_intro, or_intror/
@@ -53,22 +53,22 @@ fact minuss_inv_cons1_aux: ∀cs1,cs2,i. cs1 ▭ i ≘ cs2 →
 ]
 qed-.
 
-lemma minuss_inv_cons1: ∀cs1,cs2,l,m,i. {l, m} @ cs1 ▭ i ≘ cs2 →
+lemma minuss_inv_cons1: ∀cs1,cs2,l,m,i. {l, m} ⨮ cs1 ▭ i ≘ cs2 →
                         l ≤ i ∧ cs1 ▭ m + i ≘ cs2 ∨
                         ∃∃cs. i < l & cs1 ▭ i ≘ cs &
-                               cs2 = {l - i, m} @ cs.
+                               cs2 = {l - i, m} ⨮ cs.
 /2 width=3 by minuss_inv_cons1_aux/ qed-.
 
-lemma minuss_inv_cons1_ge: ∀cs1,cs2,l,m,i. {l, m} @ cs1 ▭ i ≘ cs2 →
+lemma minuss_inv_cons1_ge: ∀cs1,cs2,l,m,i. {l, m} ⨮ cs1 ▭ i ≘ cs2 →
                            l ≤ i → cs1 ▭ m + i ≘ cs2.
 #cs1 #cs2 #l #m #i #H
 elim (minuss_inv_cons1 … H) -H * // #cs #Hil #_ #_ #Hli
 elim (lt_le_false … Hil Hli)
 qed-.
 
-lemma minuss_inv_cons1_lt: ∀cs1,cs2,l,m,i. {l, m} @ cs1 ▭ i ≘ cs2 →
+lemma minuss_inv_cons1_lt: ∀cs1,cs2,l,m,i. {l, m} ⨮ cs1 ▭ i ≘ cs2 →
                            i < l →
-                           ∃∃cs. cs1 ▭ i ≘ cs & cs2 = {l - i, m} @ cs.
+                           ∃∃cs. cs1 ▭ i ≘ cs & cs2 = {l - i, m} ⨮ cs.
 #cs1 #cs2 #l #m #i #H elim (minuss_inv_cons1 … H) -H * /2 width=3 by ex2_intro/
 #Hli #_ #Hil elim (lt_le_false … Hil Hli)
 qed-.