X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground_2%2Fsteps%2Frtc_isrt.ma;h=1b6c7d3686535703ea34d42424e335765abffeb9;hb=bd53c4e895203eb049e75434f638f26b5a161a2b;hp=9c988abea63f85bd33a65e7d05b191bfe96b1244;hpb=138e01310a2334cd531819122c794d72d14c6e8c;p=helm.git

diff --git a/matita/matita/contribs/lambdadelta/ground_2/steps/rtc_isrt.ma b/matita/matita/contribs/lambdadelta/ground_2/steps/rtc_isrt.ma
index 9c988abea..1b6c7d368 100644
--- a/matita/matita/contribs/lambdadelta/ground_2/steps/rtc_isrt.ma
+++ b/matita/matita/contribs/lambdadelta/ground_2/steps/rtc_isrt.ma
@@ -18,47 +18,47 @@ include "ground_2/steps/rtc.ma".
 (* RT-TRANSITION COUNTER ****************************************************)
 
 definition isrt: relation2 nat rtc â Î»ts,c.
-                 ââri,rs. â©ri, rs, 0, tsâª = c.
+                 ââri,rs. â©ri,rs,0,tsâª = c.
 
 interpretation "test for costrained rt-transition counter (rtc)"
    'IsRedType ts c = (isrt ts c).
 
 (* Basic properties *********************************************************)
 
-lemma isr_00: ððâ¦0, ððâ¦.
+lemma isr_00: ððâª0,ððâ«.
 /2 width=3 by ex1_2_intro/ qed.
 
-lemma isr_10: ððâ¦0, ððâ¦.
+lemma isr_10: ððâª0,ððâ«.
 /2 width=3 by ex1_2_intro/ qed.
 
-lemma isrt_01: ððâ¦1, ððâ¦.
+lemma isrt_01: ððâª1,ððâ«.
 /2 width=3 by ex1_2_intro/ qed.
 
-lemma isrt_eq_t_trans: ân,c1,c2. ððâ¦n, c1â¦ â eq_t c1 c2 â ððâ¦n, c2â¦.
+lemma isrt_eq_t_trans: ân,c1,c2. ððâªn,c1â« â eq_t c1 c2 â ððâªn,c2â«.
 #n #c1 #c2 * #ri1 #rs1 #H destruct
 #H elim (eq_t_inv_dx â¦ H) -H /2 width=3 by ex1_2_intro/
 qed-.
 
 (* Basic inversion properties ***********************************************)
 
-lemma isrt_inv_00: ân. ððâ¦n, ððâ¦ â 0 = n.
+lemma isrt_inv_00: ân. ððâªn,ððâ« â 0 = n.
 #n * #ri #rs #H destruct //
 qed-.
 
-lemma isrt_inv_10: ân. ððâ¦n, ððâ¦ â 0 = n.
+lemma isrt_inv_10: ân. ððâªn,ððâ« â 0 = n.
 #n * #ri #rs #H destruct //
 qed-.
 
-lemma isrt_inv_01: ân. ððâ¦n, ððâ¦ â 1 = n.
+lemma isrt_inv_01: ân. ððâªn,ððâ« â 1 = n.
 #n * #ri #rs #H destruct //
 qed-.
 
 (* Main inversion properties ************************************************)
 
-theorem isrt_inj: ân1,n2,c. ððâ¦n1, câ¦ â ððâ¦n2, câ¦ â n1 = n2.
+theorem isrt_inj: ân1,n2,c. ððâªn1,câ« â ððâªn2,câ« â n1 = n2.
 #n1 #n2 #c * #ri1 #rs1 #H1 * #ri2 #rs2 #H2 destruct //
 qed-.
 
-theorem isrt_mono: ân,c1,c2. ððâ¦n, c1â¦ â ððâ¦n, c2â¦ â eq_t c1 c2.
+theorem isrt_mono: ân,c1,c2. ððâªn,c1â« â ððâªn,c2â« â eq_t c1 c2.
 #n #c1 #c2 * #ri1 #rs1 #H1 * #ri2 #rs2 #H2 destruct //
 qed-.