X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground_2%2Frelocation%2Frtmap_isfin.ma;h=3a9d2656c7fbfacb4a982107d22334fc88582d38;hp=f79431a17303bd306c160ee66c8e122e7d02f162;hb=bd53c4e895203eb049e75434f638f26b5a161a2b;hpb=3b7b8afcb429a60d716d5226a5b6ab0d003228b1

diff --git a/matita/matita/contribs/lambdadelta/ground_2/relocation/rtmap_isfin.ma b/matita/matita/contribs/lambdadelta/ground_2/relocation/rtmap_isfin.ma
index f79431a17..3a9d2656c 100644
--- a/matita/matita/contribs/lambdadelta/ground_2/relocation/rtmap_isfin.ma
+++ b/matita/matita/contribs/lambdadelta/ground_2/relocation/rtmap_isfin.ma
@@ -18,28 +18,28 @@ include "ground_2/relocation/rtmap_fcla.ma".
 (* RELOCATION MAP ***********************************************************)
 
 definition isfin: predicate rtmap ≝
-                  λf. ∃n. 𝐂⦃f⦄ ≘ n.
+                  λf. ∃n. 𝐂❪f❫ ≘ n.
 
 interpretation "test for finite colength (rtmap)"
    'IsFinite f = (isfin f).
 
 (* Basic eliminators ********************************************************)
 
-lemma isfin_ind (R:predicate rtmap): (∀f.  𝐈⦃f⦄ → R f) →
-                                     (∀f. 𝐅⦃f⦄ → R f → R (⫯f)) →
-                                     (∀f. 𝐅⦃f⦄ → R f → R (↑f)) →
-                                     ∀f. 𝐅⦃f⦄ → R f.
+lemma isfin_ind (R:predicate rtmap): (∀f.  𝐈❪f❫ → R f) →
+                                     (∀f. 𝐅❪f❫ → R f → R (⫯f)) →
+                                     (∀f. 𝐅❪f❫ → R f → R (↑f)) →
+                                     ∀f. 𝐅❪f❫ → R f.
 #R #IH1 #IH2 #IH3 #f #H elim H -H
 #n #H elim H -f -n /3 width=2 by ex_intro/
 qed-.
 
 (* Basic inversion lemmas ***************************************************)
 
-lemma isfin_inv_push: ∀g. 𝐅⦃g⦄ → ∀f. ⫯f = g → 𝐅⦃f⦄.
+lemma isfin_inv_push: ∀g. 𝐅❪g❫ → ∀f. ⫯f = g → 𝐅❪f❫.
 #g * /3 width=4 by fcla_inv_px, ex_intro/
 qed-.
 
-lemma isfin_inv_next: ∀g. 𝐅⦃g⦄ → ∀f. ↑f = g → 𝐅⦃f⦄.
+lemma isfin_inv_next: ∀g. 𝐅❪g❫ → ∀f. ↑f = g → 𝐅❪f❫.
 #g * #n #H #f #H0 elim (fcla_inv_nx … H … H0) -g
 /2 width=2 by ex_intro/
 qed-.
@@ -53,44 +53,44 @@ qed-.
 lemma isfin_eq_repl_fwd: eq_repl_fwd … isfin.
 /3 width=3 by isfin_eq_repl_back, eq_repl_sym/ qed-.
 
-lemma isfin_isid: ∀f. 𝐈⦃f⦄ → 𝐅⦃f⦄.
+lemma isfin_isid: ∀f. 𝐈❪f❫ → 𝐅❪f❫.
 /3 width=2 by fcla_isid, ex_intro/ qed.
 
-lemma isfin_push: ∀f. 𝐅⦃f⦄ → 𝐅⦃⫯f⦄.
+lemma isfin_push: ∀f. 𝐅❪f❫ → 𝐅❪⫯f❫.
 #f * /3 width=2 by fcla_push, ex_intro/
 qed.
 
-lemma isfin_next: ∀f. 𝐅⦃f⦄ → 𝐅⦃↑f⦄.
+lemma isfin_next: ∀f. 𝐅❪f❫ → 𝐅❪↑f❫.
 #f * /3 width=2 by fcla_next, ex_intro/
 qed.
 
 (* Properties with iterated push ********************************************)
 
-lemma isfin_pushs: ∀n,f. 𝐅⦃f⦄ → 𝐅⦃⫯*[n]f⦄.
+lemma isfin_pushs: ∀n,f. 𝐅❪f❫ → 𝐅❪⫯*[n]f❫.
 #n elim n -n /3 width=3 by isfin_push/
 qed.
 
 (* Inversion lemmas with iterated push **************************************)
 
-lemma isfin_inv_pushs: ∀n,g. 𝐅⦃⫯*[n]g⦄ → 𝐅⦃g⦄.
+lemma isfin_inv_pushs: ∀n,g. 𝐅❪⫯*[n]g❫ → 𝐅❪g❫.
 #n elim n -n /3 width=3 by isfin_inv_push/
 qed.
 
 (* Properties with tail *****************************************************)
 
-lemma isfin_tl: ∀f. 𝐅⦃f⦄ → 𝐅⦃⫱f⦄.
+lemma isfin_tl: ∀f. 𝐅❪f❫ → 𝐅❪⫱f❫.
 #f elim (pn_split f) * #g #H #Hf destruct
 /3 width=3 by isfin_inv_push, isfin_inv_next/
 qed.
 
 (* Inversion lemmas with tail ***********************************************)
 
-lemma isfin_inv_tl: ∀f. 𝐅⦃⫱f⦄ → 𝐅⦃f⦄.
+lemma isfin_inv_tl: ∀f. 𝐅❪⫱f❫ → 𝐅❪f❫.
 #f elim (pn_split f) * /2 width=1 by isfin_next, isfin_push/
 qed-.
 
 (* Inversion lemmas with iterated tail **************************************)
 
-lemma isfin_inv_tls: ∀n,f. 𝐅⦃⫱*[n]f⦄ → 𝐅⦃f⦄.
+lemma isfin_inv_tls: ∀n,f. 𝐅❪⫱*[n]f❫ → 𝐅❪f❫.
 #n elim n -n /3 width=1 by isfin_inv_tl/
 qed-.