]> matita.cs.unibo.it Git - helm.git/commitdiff
update in delayed_updating
authorFerruccio Guidi <ferruccio.guidi@unibo.it>
Thu, 9 Jun 2022 13:39:52 +0000 (15:39 +0200)
committerFerruccio Guidi <ferruccio.guidi@unibo.it>
Thu, 9 Jun 2022 13:39:52 +0000 (15:39 +0200)
+ bug fixed in ifr allows to prove ifr_unwind_bi

matita/matita/contribs/lambdadelta/delayed_updating/reduction/dfr.ma
matita/matita/contribs/lambdadelta/delayed_updating/reduction/ifr.ma
matita/matita/contribs/lambdadelta/delayed_updating/reduction/ifr_unwind.ma

index 7ae112491e80dd44a99080e6a7e5fa3f7baa81d5..0a4b7cf1f8b56238f652e21fd943e6a9e3a85d8d 100644 (file)
@@ -30,5 +30,5 @@ definition dfr (p) (q): relation2 prototerm prototerm ≝
 .
 
 interpretation
-  "focused balanced reduction with delayed updating (prototerm)"
+  "focused reduction with delayed updating (prototerm)"
   'BlackRightArrowDF t1 p q t2 = (dfr p q t1 t2).
index 90cd693c3a0777438aee4cc4ea299f1d2cfe7dcb..6469bb2a029e641b25501e325d242bdd3868c829 100644 (file)
@@ -16,7 +16,6 @@ include "delayed_updating/unwind/unwind2_prototerm.ma".
 include "delayed_updating/substitution/fsubst.ma".
 include "delayed_updating/syntax/prototerm_equivalence.ma".
 include "delayed_updating/syntax/path_head.ma".
-include "delayed_updating/syntax/path_depth.ma".
 include "delayed_updating/syntax/path_reverse.ma".
 include "delayed_updating/notation/relations/black_rightarrow_f_4.ma".
 
@@ -26,9 +25,9 @@ definition ifr (p) (q): relation2 prototerm prototerm ≝
            λt1,t2. ∃n:pnat.
            let r ≝ p●𝗔◗𝗟◗q in
            ∧∧ (𝗟◗q)ᴿ = ↳[n](rᴿ) & r◖𝗱n ϵ t1 &
-              t1[⋔r←▼[𝐮❨♭(𝗟◗q)❩](t1⋔(p◖𝗦))] ⇔ t2
+              t1[⋔r←▼[𝐮❨n❩](t1⋔(p◖𝗦))] ⇔ t2
 .
 
 interpretation
-  "focused balanced reduction with immediate updating (prototerm)"
+  "focused reduction with immediate updating (prototerm)"
   'BlackRightArrowF t1 p q t2 = (ifr p q t1 t2).
index 9bd4cd7c47f21e086d9798e24966f0b02c3c6cbf..21e4ac27fac27dea7ae8c91a9ed629b509f3d66a 100644 (file)
@@ -32,9 +32,9 @@ include "delayed_updating/syntax/path_depth_reverse.ma".
 
 (* Constructions with unwind ************************************************)
 
-theorem ifr_unwind_bi (f) (p) (q) (t1) (t2):
-        t1 ϵ 𝐓 → t1⋔(p◖𝗦) ⧸≬ 𝐈 →
-        t1 ➡𝐟[p,q] t2 → ▼[f]t1 ➡𝐟[⊗p,⊗q] ▼[f]t2.
+lemma ifr_unwind_bi (f) (p) (q) (t1) (t2):
+      t1 ϵ 𝐓 → t1⋔(p◖𝗦) ⧸≬ 𝐈 →
+      t1 ➡𝐟[p,q] t2 → ▼[f]t1 ➡𝐟[⊗p,⊗q] ▼[f]t2.
 #f #p #q #t1 #t2 #H1t1 #H2t1
 * #n * #H1n #Ht1 #Ht2
 @(ex_intro … (↑♭q)) @and3_intro