X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambda_delta%2FBasic_2%2Fgrammar%2Fthom.ma;h=5b90bd1d37bcbdb1a803253d520222a0046944e6;hb=77c6a180035cd63f3edd4db54bd7e9b411f9e85e;hp=aaade3b54324f39304ce3343af8cbddd5cd93e2d;hpb=18ac3a120a3887b144c1d0e13d64d6e1c2d10d93;p=helm.git

diff --git a/matita/matita/contribs/lambda_delta/Basic_2/grammar/thom.ma b/matita/matita/contribs/lambda_delta/Basic_2/grammar/thom.ma
index aaade3b54..5b90bd1d3 100644
--- a/matita/matita/contribs/lambda_delta/Basic_2/grammar/thom.ma
+++ b/matita/matita/contribs/lambda_delta/Basic_2/grammar/thom.ma
@@ -17,10 +17,10 @@ include "Basic_2/grammar/term_simple.ma".
 (* HOMOMORPHIC TERMS ********************************************************)
 
 inductive thom: relation term ≝
-   | thom_atom: ∀I. thom (𝕒{I}) (𝕒{I})
-   | thom_abst: ∀V1,V2,T1,T2. thom (𝕔{Abst} V1. T1) (𝕔{Abst} V2. T2)
-   | thom_appl: ∀V1,V2,T1,T2. thom T1 T2 → 𝕊[T1] → 𝕊[T2] →
-                thom (𝕔{Appl} V1. T1) (𝕔{Appl} V2. T2)
+   | thom_atom: ∀I. thom (⓪{I}) (⓪{I})
+   | thom_abst: ∀V1,V2,T1,T2. thom (ⓛV1. T1) (ⓛV2. T2)
+   | thom_appl: ∀V1,V2,T1,T2. thom T1 T2 → 𝐒[T1] → 𝐒[T2] →
+                thom (ⓐV1. T1) (ⓐV2. T2)
 .
 
 interpretation "homomorphic (term)" 'napart T1 T2 = (thom T1 T2).
@@ -38,19 +38,19 @@ qed.
 lemma thom_refl1: ∀T1,T2. T1 ≈ T2 → T1 ≈ T1.
 /3 width=2/ qed.
 
-lemma simple_thom_repl_dx: ∀T1,T2. T1 ≈ T2 → 𝕊[T1] → 𝕊[T2].
+lemma simple_thom_repl_dx: ∀T1,T2. T1 ≈ T2 → 𝐒[T1] → 𝐒[T2].
 #T1 #T2 #H elim H -T1 -T2 //
 #V1 #V2 #T1 #T2 #H
 elim (simple_inv_bind … H)
 qed. (**) (* remove from index *)
 
-lemma simple_thom_repl_sn: ∀T1,T2. T1 ≈ T2 → 𝕊[T2] → 𝕊[T1].
+lemma simple_thom_repl_sn: ∀T1,T2. T1 ≈ T2 → 𝐒[T2] → 𝐒[T1].
 /3 width=3/ qed-.
 
 (* Basic inversion lemmas ***************************************************)
 
-fact thom_inv_bind1_aux: ∀T1,T2. T1 ≈ T2 → ∀I,W1,U1. T1 = 𝕓{I}W1.U1 →
-                         ∃∃W2,U2. I = Abst & T2 = 𝕔{Abst} W2. U2.
+fact thom_inv_bind1_aux: ∀T1,T2. T1 ≈ T2 → ∀I,W1,U1. T1 = ⓑ{I}W1.U1 →
+                         ∃∃W2,U2. I = Abst & T2 = ⓛW2. U2.
 #T1 #T2 * -T1 -T2
 [ #J #I #W1 #U1 #H destruct
 | #V1 #V2 #T1 #T2 #I #W1 #U1 #H destruct /2 width=3/
@@ -58,13 +58,13 @@ fact thom_inv_bind1_aux: ∀T1,T2. T1 ≈ T2 → ∀I,W1,U1. T1 = 𝕓{I}W1.U1 
 ]
 qed.
 
-lemma thom_inv_bind1: ∀I,W1,U1,T2. 𝕓{I}W1.U1 ≈ T2 →
-                      ∃∃W2,U2. I = Abst & T2 = 𝕔{Abst} W2. U2.
+lemma thom_inv_bind1: ∀I,W1,U1,T2. ⓑ{I}W1.U1 ≈ T2 →
+                      ∃∃W2,U2. I = Abst & T2 = ⓛW2. U2.
 /2 width=5/ qed-.
 
-fact thom_inv_flat1_aux: ∀T1,T2. T1 ≈ T2 → ∀I,W1,U1. T1 = 𝕗{I}W1.U1 →
-                         ∃∃W2,U2. U1 ≈ U2 & 𝕊[U1] & 𝕊[U2] &
-                                  I = Appl & T2 = 𝕔{Appl} W2. U2.
+fact thom_inv_flat1_aux: ∀T1,T2. T1 ≈ T2 → ∀I,W1,U1. T1 = ⓕ{I}W1.U1 →
+                         ∃∃W2,U2. U1 ≈ U2 & 𝐒[U1] & 𝐒[U2] &
+                                  I = Appl & T2 = ⓐW2. U2.
 #T1 #T2 * -T1 -T2
 [ #J #I #W1 #U1 #H destruct
 | #V1 #V2 #T1 #T2 #I #W1 #U1 #H destruct
@@ -72,12 +72,7 @@ fact thom_inv_flat1_aux: ∀T1,T2. T1 ≈ T2 → ∀I,W1,U1. T1 = 𝕗{I}W1.U1 
 ]
 qed.
 
-lemma thom_inv_flat1: ∀I,W1,U1,T2. 𝕗{I}W1.U1 ≈ T2 →
-                      ∃∃W2,U2. U1 ≈ U2 & 𝕊[U1] & 𝕊[U2] &
-                               I = Appl & T2 = 𝕔{Appl} W2. U2.
+lemma thom_inv_flat1: ∀I,W1,U1,T2. ⓕ{I}W1.U1 ≈ T2 →
+                      ∃∃W2,U2. U1 ≈ U2 & 𝐒[U1] & 𝐒[U2] &
+                               I = Appl & T2 = ⓐW2. U2.
 /2 width=4/ qed-.
-
-(* Basic_1: removed theorems 7:
-            iso_gen_sort iso_gen_lref iso_gen_head iso_refl iso_trans
-            iso_flats_lref_bind_false iso_flats_flat_bind_false
-*)