]> matita.cs.unibo.it Git - helm.git/blobdiff - matita/matita/contribs/lambdadelta/delayed_updating/unwind/unwind2_preterm_eq.ma
update in delayed_updating
[helm.git] / matita / matita / contribs / lambdadelta / delayed_updating / unwind / unwind2_preterm_eq.ma
index 9ceccc0e2a0a0c5fa5cc101e3d22f7dbb1ea282a..a78d4b9edc18a7e0e01e3750e0c27f0dfd80663e 100644 (file)
 (**************************************************************************)
 
 include "delayed_updating/unwind/unwind2_prototerm.ma".
-include "delayed_updating/unwind/unwind2_path_structure.ma".
+include "delayed_updating/unwind/unwind2_path_append.ma".
 include "delayed_updating/syntax/preterm.ma".
 include "delayed_updating/syntax/path_structure_inner.ma".
 include "ground/lib/subset_equivalence.ma".
 
-(* UNWIND FOR PRETERM *******************************************************)
+(* TAILED UNWIND FOR PRETERM ************************************************)
 
 (* Constructions with subset_equivalence ************************************)
 
 lemma unwind2_term_grafted_sn (f) (t) (p): p ϵ 𝐈 →
-      ▼[▶[f]pᴿ](t⋔p) ⊆ (▼[f]t)⋔(⊗p).
+      ▼[▶[f]p](t⋔p) ⊆ (▼[f]t)⋔(⊗p).
 #f #t #p #Hp #q * #r #Hr #H0 destruct
 @(ex2_intro … Hr) -Hr
-<unwind2_path_append_inner_sn //
+<unwind2_path_append_pic_sn //
 qed-.
 
 lemma unwind2_term_grafted_dx (f) (t) (p): p ϵ 𝐈 → p ϵ ▵t → t ϵ 𝐓 →
-      (▼[f]t)⋔(⊗p) ⊆ ▼[▶[f]pᴿ](t⋔p).
+      (▼[f]t)⋔(⊗p) ⊆ ▼[▶[f]p](t⋔p).
 #f #t #p #H1p #H2p #Ht #q * #r #Hr #H0
-elim (unwind2_path_inv_append_inner_sn … (sym_eq … H0)) -H0 //
+elim (unwind2_path_des_append_pic_sn … (sym_eq … H0)) -H0 //
 #p0 #q0 #Hp0 #Hq0 #H0 destruct
-<(Ht … Hp0) [|*: /2 width=2 by ex_intro/ ] -p
+>(Ht … Hp0) [|*: /2 width=2 by ex_intro/ ] -p
 /2 width=1 by in_comp_unwind2_path_term/
 qed-.
 
 lemma unwind2_term_grafted (f) (t) (p): p ϵ 𝐈 → p ϵ ▵t → t ϵ 𝐓 →
-      ▼[▶[f]pᴿ](t⋔p) ⇔ (▼[f]t)⋔(⊗p).
+      ▼[▶[f]p](t⋔p) ⇔ (▼[f]t)⋔(⊗p).
 /3 width=1 by unwind2_term_grafted_sn, unwind2_term_grafted_dx, conj/ qed.
 
 lemma unwind2_term_grafted_S_dx (f) (t) (p): p ϵ ▵t → t ϵ 𝐓 →
-      (▼[f]t)⋔((⊗p)◖𝗦) ⊆ ▼[▶[f]pᴿ](t⋔(p◖𝗦)).
+      (▼[f]t)⋔((⊗p)◖𝗦) ⊆ ▼[▶[f]p](t⋔(p◖𝗦)).
 #f #t #p #Hp #Ht #q * #r #Hr
-<list_append_rcons_sn #H0
-elim (unwind2_path_inv_append_proper_dx … (sym_eq … H0)) -H0 //
+>list_append_rcons_sn #H0
+elim (unwind2_path_inv_append_ppc_dx … (sym_eq … H0)) -H0 //
 #p0 #q0 #Hp0 #Hq0 #H0 destruct
-<(Ht … Hp0) [|*: /2 width=2 by ex_intro/ ] -p
-elim (unwind2_path_inv_S_sn … (sym_eq … Hq0)) -Hq0
+>(Ht … Hp0) [|*: /2 width=2 by ex_intro/ ] -p
+elim (eq_inv_S_sn_unwind2_path … Hq0) -Hq0
 #r1 #r2 #Hr1 #Hr2 #H0 destruct
 lapply (preterm_in_root_append_inv_structure_empty_dx … p0 … Ht Hr1)
 [ /2 width=2 by ex_intro/ ] -Hr1 #Hr1 destruct
@@ -57,10 +57,10 @@ lapply (preterm_in_root_append_inv_structure_empty_dx … p0 … Ht Hr1)
 qed-.
 
 lemma unwind2_term_grafted_S (f) (t) (p): p ϵ ▵t → t ϵ 𝐓 →
-      ▼[▶[f]pᴿ](t⋔(p◖𝗦)) ⇔ (▼[f]t)⋔((⊗p)◖𝗦).
+      ▼[▶[f]p](t⋔(p◖𝗦)) ⇔ (▼[f]t)⋔((⊗p)◖𝗦).
 #f #t #p #Hp #Ht
 @conj
-[ >unwind2_rmap_S_sn >reverse_rcons >structure_S_dx
+[ >unwind2_rmap_S_dx >structure_S_dx
   @unwind2_term_grafted_sn // (**) (* auto fails *)
 | /2 width=1 by unwind2_term_grafted_S_dx/
 ]