include "delayed_updating/unwind/unwind2_constructors.ma".
include "delayed_updating/unwind/unwind2_preterm_fsubst.ma".
include "delayed_updating/unwind/unwind2_preterm_eq.ma".
+include "delayed_updating/unwind/unwind2_prototerm_lift.ma".
include "delayed_updating/unwind/unwind2_rmap_head.ma".
include "delayed_updating/substitution/fsubst_eq.ma".
+include "delayed_updating/substitution/lift_prototerm_eq.ma".
include "delayed_updating/syntax/prototerm_proper_constructors.ma".
include "delayed_updating/syntax/path_head_structure.ma".
@(subset_eq_trans … (unwind2_term_fsubst …))
[ @fsubst_eq_repl [ // | // ]
@(subset_eq_trans … (unwind2_term_iref …))
- @(subset_eq_canc_sn … (unwind2_term_eq_repl_dx …))
+ @(subset_eq_canc_sn … (lift_term_eq_repl_dx …))
[ @unwind2_term_grafted_S /2 width=2 by ex_intro/ | skip ] -Ht1
- @(subset_eq_trans … (unwind2_term_after …))
+ @(subset_eq_trans … (lift_unwind2_term_after …))
@unwind2_term_eq_repl_sn
(* Note: crux of the proof begins *)
@nstream_eq_inv_ext #m
include "delayed_updating/substitution/fsubst_lift.ma".
include "delayed_updating/substitution/fsubst_eq.ma".
include "delayed_updating/substitution/lift_constructors.ma".
-include "delayed_updating/substitution/lift_prototerm_eq.ma".
include "delayed_updating/substitution/lift_path_head.ma".
include "delayed_updating/substitution/lift_rmap_head.ma".
(* *)
(**************************************************************************)
-include "delayed_updating/unwind/unwind2_prototerm.ma".
include "delayed_updating/substitution/fsubst.ma".
+include "delayed_updating/substitution/lift_prototerm.ma".
include "delayed_updating/syntax/prototerm_eq.ma".
include "delayed_updating/syntax/path_head.ma".
+include "delayed_updating/syntax/path_reverse.ma".
include "delayed_updating/notation/relations/black_rightarrow_if_4.ma".
(* IMMEDIATE FOCUSED REDUCTION ************************************************)
λt1,t2. ∃n:pnat.
let r ≝ p●𝗔◗𝗟◗q in
∧∧ (𝗟◗q)ᴿ = ↳[n](rᴿ) & r◖𝗱n ϵ t1 &
- t1[â\8b\94râ\86\90â\96¼[𝐮❨n❩](t1⋔(p◖𝗦))] ⇔ t2
+ t1[â\8b\94râ\86\90â\86\91[𝐮❨n❩](t1⋔(p◖𝗦))] ⇔ t2
.
interpretation
include "delayed_updating/reduction/ifr.ma".
-include "delayed_updating/unwind/unwind2_path_lift.ma".
-
include "delayed_updating/substitution/fsubst_lift.ma".
include "delayed_updating/substitution/fsubst_eq.ma".
-include "delayed_updating/substitution/lift_prototerm_eq.ma".
include "delayed_updating/substitution/lift_path_head.ma".
include "delayed_updating/substitution/lift_rmap_head.ma".
+include "ground/relocation/tr_uni_compose.ma".
+include "ground/relocation/tr_compose_eq.ma".
+
(* IMMEDIATE FOCUSED REDUCTION **********************************************)
(* Constructions with lift **************************************************)
@(subset_eq_trans … Ht2) -t2
@(subset_eq_trans … (lift_term_fsubst …))
@fsubst_eq_repl [ // | <lift_path_append // ]
-(*
- @(subset_eq_trans … (lift_term_iref …))
- @iref_eq_repl
- @(subset_eq_canc_sn … (lift_term_grafted_S …))
+ @(subset_eq_canc_sn … (lift_term_eq_repl_dx …))
+ [ @lift_term_grafted_S | skip ]
+ @(subset_eq_trans … (lift_term_after …))
+ @(subset_eq_canc_dx … (lift_term_after …))
@lift_term_eq_repl_sn
(* Note: crux of the proof begins *)
+ @(stream_eq_trans … (tr_compose_uni_dx …))
+ @tr_compose_eq_repl //
>list_append_rcons_sn in H1n; #H1n >lift_rmap_A_dx
/2 width=1 by tls_lift_rmap_append_closed/
(* Note: crux of the proof ends *)
]
qed.
-*)
\ No newline at end of file
include "delayed_updating/reduction/ifr.ma".
-include "delayed_updating/unwind/unwind2_constructors.ma".
include "delayed_updating/unwind/unwind2_preterm_fsubst.ma".
include "delayed_updating/unwind/unwind2_preterm_eq.ma".
-include "delayed_updating/unwind/unwind2_prototerm_inner.ma".
+include "delayed_updating/unwind/unwind2_prototerm_lift.ma".
include "delayed_updating/unwind/unwind2_rmap_head.ma".
include "delayed_updating/substitution/fsubst_eq.ma".
+include "delayed_updating/substitution/lift_prototerm_proper.ma".
+include "delayed_updating/substitution/lift_prototerm_eq.ma".
-include "delayed_updating/syntax/prototerm_proper_inner.ma".
include "delayed_updating/syntax/path_head_structure.ma".
include "delayed_updating/syntax/path_structure_depth.ma".
include "delayed_updating/syntax/path_structure_reverse.ma".
(* Constructions with unwind ************************************************)
lemma ifr_unwind_bi (f) (p) (q) (t1) (t2):
- t1 ϵ 𝐓 → t1⋔(p◖𝗦) ⧸≬ 𝐈 →
+ t1 ϵ 𝐓 → t1⋔(p◖𝗦) ϵ 𝐏 →
t1 ➡𝐢𝐟[p,q] t2 → ▼[f]t1 ➡𝐢𝐟[⊗p,⊗q] ▼[f]t2.
#f #p #q #t1 #t2 #H1t1 #H2t1
* #n * #H1n #Ht1 #Ht2
@(subset_eq_trans … Ht2) -t2
@(subset_eq_trans … (unwind2_term_fsubst …))
[ @fsubst_eq_repl [ // | // ]
- @(subset_eq_canc_dx … (unwind2_term_after …))
- @(subset_eq_canc_sn … (unwind2_term_eq_repl_dx …))
+ @(subset_eq_canc_sn … (lift_term_eq_repl_dx …))
[ @unwind2_term_grafted_S /2 width=2 by ex_intro/ | skip ] -Ht1
- @(subset_eq_trans … (unwind2_term_after …))
+ @(subset_eq_trans … (lift_unwind2_term_after …))
+ @(subset_eq_canc_dx … (unwind2_term_after_lift …))
@unwind2_term_eq_repl_sn
(* Note: crux of the proof begins *)
@nstream_eq_inv_ext #m
(* Note: crux of the proof ends *)
| //
| /2 width=2 by ex_intro/
- | @term_proper_outer #H0 (**) (* full auto does not work *)
- /3 width=2 by unwind2_term_des_inner/
+ | /2 width=6 by lift_term_proper/
]
]
qed.
+++ /dev/null
-(**************************************************************************)
-(* ___ *)
-(* ||M|| *)
-(* ||A|| A project by Andrea Asperti *)
-(* ||T|| *)
-(* ||I|| Developers: *)
-(* ||T|| The HELM team. *)
-(* ||A|| http://helm.cs.unibo.it *)
-(* \ / *)
-(* \ / This file is distributed under the terms of the *)
-(* v GNU General Public License Version 2 *)
-(* *)
-(**************************************************************************)
-
-include "delayed_updating/unwind/unwind2_path_structure.ma".
-include "delayed_updating/syntax/path_inner.ma".
-
-(* UNWIND FOR PATH **********************************************************)
-
-(* Destructions with inner condition for path *******************************)
-
-lemma unwind2_path_des_inner (f) (p):
- ▼[f]p ϵ 𝐈 → p ϵ 𝐈.
-#f #p @(list_ind_rcons … p) -p //
-#p * [ #n ] #_ //
-<unwind2_path_d_dx #H0
-elim (pic_inv_d_dx … H0)
-qed-.
<reverse_rcons <list_tl_lcons <unwind2_rmap_append
@ex3_2_intro [4: |*: // ] <unwind2_path_unfold // (**) (* auto fails *)
qed-.
+
+(* Destructions with inner condition for path *******************************)
+
+lemma unwind2_path_des_inner (f) (p):
+ ▼[f]p ϵ 𝐈 → p ϵ 𝐈.
+#f #p @(list_ind_rcons … p) -p //
+#p * [ #n ] #_ //
+<unwind2_path_d_dx #H0
+elim (pic_inv_d_dx … H0)
+qed-.
(**************************************************************************)
include "delayed_updating/unwind/unwind2_prototerm.ma".
-include "delayed_updating/unwind/unwind2_path_inner.ma".
+include "delayed_updating/unwind/unwind2_path_structure.ma".
include "ground/lib/subset_overlap.ma".
(* UNWIND FOR PROTOTERM *****************************************************)