X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground%2Frelocation%2Fpr_fcla.ma;h=d0a9216b49f306ea12e8f9a53fa3ac29ef5971ef;hb=df1bcd1387439133c0c33f597a5f8b2331c07772;hp=54c81af81afdf29e07dbf3271f4b2042dc81dd24;hpb=f8b4eb67c2437f7b5174d7dca46e102e0ac0d19d;p=helm.git diff --git a/matita/matita/contribs/lambdadelta/ground/relocation/pr_fcla.ma b/matita/matita/contribs/lambdadelta/ground/relocation/pr_fcla.ma index 54c81af81..d0a9216b4 100644 --- a/matita/matita/contribs/lambdadelta/ground/relocation/pr_fcla.ma +++ b/matita/matita/contribs/lambdadelta/ground/relocation/pr_fcla.ma @@ -21,7 +21,7 @@ include "ground/relocation/pr_isi.ma". (*** fcla *) inductive pr_fcla: relation2 pr_map nat ≝ (*** fcla_isid *) -| pr_fcla_isi (f): 𝐈❪f❫ → pr_fcla f (𝟎) +| pr_fcla_isi (f): 𝐈❨f❩ → pr_fcla f (𝟎) (*** fcla_push *) | pr_fcla_push (f) (n): pr_fcla f n → pr_fcla (⫯f) n (*** fcla_next *) @@ -35,7 +35,7 @@ interpretation (* Basic inversions *********************************************************) (*** fcla_inv_px *) -lemma pr_fcla_inv_push (g) (m): 𝐂❪g❫ ≘ m → ∀f. ⫯f = g → 𝐂❪f❫ ≘ m. +lemma pr_fcla_inv_push (g) (m): 𝐂❨g❩ ≘ m → ∀f. ⫯f = g → 𝐂❨f❩ ≘ m. #g #m * -g -m [ /3 width=3 by pr_fcla_isi, pr_isi_inv_push/ | #g #m #Hg #f #H >(eq_inv_pr_push_bi … H) -f // @@ -44,7 +44,7 @@ lemma pr_fcla_inv_push (g) (m): 𝐂❪g❫ ≘ m → ∀f. ⫯f = g → 𝐂❪ qed-. (*** fcla_inv_nx *) -lemma pr_fcla_inv_next (g) (m): 𝐂❪g❫ ≘ m → ∀f. ↑f = g → ∃∃n. 𝐂❪f❫ ≘ n & ↑n = m. +lemma pr_fcla_inv_next (g) (m): 𝐂❨g❩ ≘ m → ∀f. ↑f = g → ∃∃n. 𝐂❨f❩ ≘ n & ↑n = m. #g #m * -g -m [ #g #Hg #f #H destruct elim (pr_isi_inv_next … Hg) -Hg // @@ -57,25 +57,25 @@ qed-. (* Advanced inversions ******************************************************) (*** cla_inv_nn *) -lemma pr_cla_inv_next_succ (g) (m): 𝐂❪g❫ ≘ m → ∀f,n. ↑f = g → ↑n = m → 𝐂❪f❫ ≘ n. +lemma pr_cla_inv_next_succ (g) (m): 𝐂❨g❩ ≘ m → ∀f,n. ↑f = g → ↑n = m → 𝐂❨f❩ ≘ n. #g #m #H #f #n #H1 #H2 elim (pr_fcla_inv_next … H … H1) -g #x #Hf #H destruct <(eq_inv_nsucc_bi … H) -n // qed-. (*** cla_inv_np *) -lemma pr_cla_inv_next_zero (g) (m): 𝐂❪g❫ ≘ m → ∀f. ↑f = g → 𝟎 = m → ⊥. +lemma pr_cla_inv_next_zero (g) (m): 𝐂❨g❩ ≘ m → ∀f. ↑f = g → 𝟎 = m → ⊥. #g #m #H #f #H1 elim (pr_fcla_inv_next … H … H1) -g #x #_ #H1 #H2 destruct /2 width=2 by eq_inv_zero_nsucc/ qed-. (*** fcla_inv_xp *) -lemma pr_fcla_inv_zero (g) (m): 𝐂❪g❫ ≘ m → 𝟎 = m → 𝐈❪g❫. +lemma pr_fcla_inv_zero (g) (m): 𝐂❨g❩ ≘ m → 𝟎 = m → 𝐈❨g❩. #g #m #H elim H -g -m /3 width=3 by pr_isi_push/ #g #m #_ #_ #H destruct elim (eq_inv_zero_nsucc … H) qed-. (*** fcla_inv_isid *) -lemma pr_fcla_inv_isi (g) (m): 𝐂❪g❫ ≘ m → 𝐈❪g❫ → 𝟎 = m. +lemma pr_fcla_inv_isi (g) (m): 𝐂❨g❩ ≘ m → 𝐈❨g❩ → 𝟎 = m. #f #n #H elim H -f -n /3 width=3 by pr_isi_inv_push/ #f #n #_ #_ #H elim (pr_isi_inv_next … H) -H // qed-.