update in ground_2, static_2, basic_2

[helm.git] / matita / matita / contribs / lambdadelta / ground_2 / steps / rtc_max.ma

diff --git a/matita/matita/contribs/lambdadelta/ground_2/steps/rtc_max.ma b/matita/matita/contribs/lambdadelta/ground_2/steps/rtc_max.ma
index 46f457536456d6e034d544f3e4c1e604101bb6e0..a6e0efa87c5cb4ec93ceaaff7820e23c2b2ab82f 100644 (file)
--- a/matita/matita/contribs/lambdadelta/ground_2/steps/rtc_max.ma
+++ b/matita/matita/contribs/lambdadelta/ground_2/steps/rtc_max.ma
@@ -12,13 +12,14 @@
 (*                                                                        *)
 (**************************************************************************)
 
-include "ground_2/steps/rtc_shift.ma".
+include "ground_2/xoa/ex_6_8.ma".
+include "ground_2/steps/rtc.ma".
 
 (* RT-TRANSITION COUNTER ****************************************************)
 
 definition max (c1:rtc) (c2:rtc): rtc ≝ match c1 with [
    mk_rtc ri1 rs1 ti1 ts1 ⇒ match c2 with [
-      mk_rtc ri2 rs2 ti2 ts2 ⇒ 〈ri1∨ri2, rs1∨rs2, ti1∨ti2, ts1∨ts2〉
+      mk_rtc ri2 rs2 ti2 ts2 ⇒ 〈ri1∨ri2,rs1∨rs2,ti1∨ti2,ts1∨ts2〉
    ]
 ].
 
@@ -28,7 +29,7 @@ interpretation "maximum (rtc)"
 (* Basic properties *********************************************************)
 
 lemma max_rew: ∀ri1,ri2,rs1,rs2,ti1,ti2,ts1,ts2.
-                 〈ri1∨ri2, rs1∨rs2, ti1∨ti2, ts1∨ts2〉 =
+                 〈ri1∨ri2,rs1∨rs2,ti1∨ti2,ts1∨ts2〉 =
                  (〈ri1,rs1,ti1,ts1〉 ∨ 〈ri2,rs2,ti2,ts2〉).
 // qed.
 
@@ -56,39 +57,3 @@ theorem max_assoc: associative … max.
 * #ri1 #rs1 #ti1 #ts1 * #ri2 #rs2 #ti2 #ts2 * #ri3 #rs3 #ti3 #ts3
 <max_rew <max_rew //
 qed.
-
-(* Properties with test for constrained rt-transition counter ***************)
-
-lemma isrt_max: ∀n1,n2,c1,c2. 𝐑𝐓⦃n1, c1⦄ → 𝐑𝐓⦃n2, c2⦄ → 𝐑𝐓⦃n1∨n2, c1∨c2⦄.
-#n1 #n2 #c1 #c2 * #ri1 #rs1 #H1 * #ri2 #rs2 #H2 destruct
-/2 width=3 by ex1_2_intro/
-qed.
-
-lemma isrt_max_O1: ∀n,c1,c2. 𝐑𝐓⦃0, c1⦄ → 𝐑𝐓⦃n, c2⦄ → 𝐑𝐓⦃n, c1∨c2⦄.
-/2 width=1 by isrt_max/ qed.
-
-lemma isrt_max_O2: ∀n,c1,c2. 𝐑𝐓⦃n, c1⦄ → 𝐑𝐓⦃0, c2⦄ → 𝐑𝐓⦃n, c1∨c2⦄.
-#n #c1 #c2 #H1 #H2 >(max_O2 n) /2 width=1 by isrt_max/
-qed.
-
-(* Inversion properties with test for constrained rt-transition counter *****)
-
-lemma isrt_inv_max: ∀n,c1,c2. 𝐑𝐓⦃n, c1 ∨ c2⦄ →
-                    ∃∃n1,n2. 𝐑𝐓⦃n1, c1⦄ & 𝐑𝐓⦃n2, c2⦄ & (n1 ∨ n2) = n.
-#n #c1 #c2 * #ri #rs #H
-elim (max_inv_dx … H) -H #ri1 #rs1 #ti1 #ts1 #ri2 #rs2 #ti2 #ts2 #_ #_ #H1 #H2 #H3 #H4
-elim (max_inv_O3 … H1) -H1 /3 width=5 by ex3_2_intro, ex1_2_intro/
-qed-.
-
-lemma isrt_inv_max_O_dx: ∀n,c1,c2. 𝐑𝐓⦃n, c1 ∨ c2⦄ → 𝐑𝐓⦃0, c2⦄ → 𝐑𝐓⦃n, c1⦄.
-#n #c1 #c2 #H #H2
-elim (isrt_inv_max … H) -H #n1 #n2 #Hn1 #Hn2 #H destruct
-lapply (isrt_mono … Hn2 H2) -c2 #H destruct //
-qed-.
-
-(* Properties with shift ****************************************************)
-
-lemma max_shift: ∀c1,c2. ((↓c1) ∨ (↓c2)) = ↓(c1∨c2).
-* #ri1 #rs1 #ti1 #ts1 * #ri2 #rs2 #ti2 #ts2
-<shift_rew <shift_rew <shift_rew <max_rew //
-qed.