--- /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/syntax/path_closed.ma".
+include "delayed_updating/syntax/path_height.ma".
+include "delayed_updating/syntax/path_depth.ma".
+
+(* CLOSED CONDITION FOR PATH ************************************************)
+
+(* Constructions with height and depth **************************************)
+
+lemma path_closed_depth (p) (n):
+ p ϵ 𝐂❨n❩ → ♯p + n = ♭p.
+#p #n #Hn elim Hn -Hn //
+#p #n #_ #IH <nplus_succ_dx //
+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 "ground/arith/nat_plus.ma".
+include "delayed_updating/syntax/path.ma".
+include "delayed_updating/notation/functions/sharp_1.ma".
+
+(* HEIGHT FOR PATH **********************************************************)
+
+rec definition height (p) on p: nat ≝
+match p with
+[ list_empty ⇒ 𝟎
+| list_lcons l q ⇒
+ match l with
+ [ label_d k ⇒ height q + k
+ | label_m ⇒ height q
+ | label_L ⇒ height q
+ | label_A ⇒ height q
+ | label_S ⇒ height q
+ ]
+].
+
+interpretation
+ "height (path)"
+ 'Sharp p = (height p).
+
+(* Basic constructions ******************************************************)
+
+lemma height_empty: 𝟎 = ♯𝐞.
+// qed.
+
+lemma height_d_dx (p) (k:pnat):
+ (♯p)+k = ♯(p◖𝗱k).
+// qed.
+
+lemma height_m_dx (p):
+ (♯p) = ♯(p◖𝗺).
+// qed.
+
+lemma height_L_dx (p):
+ (♯p) = ♯(p◖𝗟).
+// qed.
+
+lemma height_A_dx (p):
+ (♯p) = ♯(p◖𝗔).
+// qed.
+
+lemma height_S_dx (p):
+ (♯p) = ♯(p◖𝗦).
+// qed.
+
+(* Main constructions *******************************************************)
+
+theorem height_append (p) (q):
+ (♯p+♯q) = ♯(p●q).
+#p #q elim q -q //
+* [ #k ] #q #IH <list_append_lcons_sn
+[ <height_d_dx <height_d_dx //
+| <height_m_dx <height_m_dx //
+| <height_L_dx <height_L_dx //
+| <height_A_dx <height_A_dx //
+| <height_S_dx <height_S_dx //
+]
+qed.
+
+(* Constructions with path_lcons ********************************************)
+
+lemma height_d_sn (p) (k:pnat):
+ k+♯p = ♯(𝗱k◗p).
+// qed.
+
+lemma height_m_sn (p):
+ ♯p = ♯(𝗺◗p).
+// qed.
+
+lemma height_L_sn (p):
+ ♯p = ♯(𝗟◗p).
+// qed.
+
+lemma height_A_sn (p):
+ ♯p = ♯(𝗔◗p).
+// qed.
+
+lemma height_S_sn (p):
+ ♯p = ♯(𝗦◗p).
+// 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 *)
+(* *)
+(**************************************************************************)
+
+(* NOTATION FOR DELAYED UPDATING ********************************************)
+
+notation "hvbox( ♯ break term 90 p )"
+ non associative with precedence 70
+ for @{ 'Sharp $p }.
METAVARIABLES
b : balanced path
+ d : depth
f, g : update function
h, k : reference index by depth
l : label
(* NOTATION FOR DELAYED UPDATING ********************************************)
-notation "hvbox( 𝗱 break term 70 a )"
+notation "hvbox( 𝗱 break term 70 k )"
non associative with precedence 70
- for @{ 'NodeLabelD $a }.
+ for @{ 'NodeLabelD $k }.
--- /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 *)
+(* *)
+(**************************************************************************)
+
+(* NOTATION FOR DELAYED UPDATING ********************************************)
+
+notation "hvbox( 𝗱 ❨ break term 46 k, break term 46 d ❩ )"
+ non associative with precedence 70
+ for @{ 'NodeLabelD $k $d }.
+++ /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 *)
-(* *)
-(**************************************************************************)
-
-(* NOTATION FOR DELAYED UPDATING ********************************************)
-
-notation "hvbox( ♯ break term 90 p )"
- non associative with precedence 70
- for @{ 'Sharp $p }.
--- /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 *)
+(* *)
+(**************************************************************************)
+
+(* NOTATION FOR DELAYED UPDATING ********************************************)
+
+notation "hvbox( 𝛕 ❨ break term 46 k, break term 46 d ❩. break term 70 t )"
+ non associative with precedence 70
+ for @{ 'Tau $k $d $t }.
* Initial invocation: - Patience on me to gain peace and perfection! -
*)
-include "ground/arith/pnat.ma".
+include "ground/arith/nat.ma".
include "delayed_updating/notation/functions/nodelabel_d_1.ma".
+include "delayed_updating/notation/functions/nodelabel_d_2.ma".
include "delayed_updating/notation/functions/nodelabel_m_0.ma".
include "delayed_updating/notation/functions/edgelabel_l_0.ma".
include "delayed_updating/notation/functions/edgelabel_a_0.ma".
(* LABEL ********************************************************************)
inductive label: Type[0] ≝
-| label_d: pnat → label
-| label_m: label
-| label_L: label
-| label_A: label
-| label_S: label
+| label_d : pnat → label
+| label_d2: pnat → nat → label
+| label_m : label
+| label_L : label
+| label_A : label
+| label_S : label
.
interpretation
"variable reference by depth (label)"
'NodeLabelD k = (label_d k).
+interpretation
+ "variable reference by depth with offset (label)"
+ 'NodeLabelD k d = (label_d2 k d).
+
interpretation
"mark (label)"
'NodeLabelM = (label_m).
+++ /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/syntax/path_closed.ma".
-include "delayed_updating/syntax/path_height.ma".
-include "delayed_updating/syntax/path_depth.ma".
-
-(* CLOSED CONDITION FOR PATH ************************************************)
-
-(* Constructions with height and depth **************************************)
-
-lemma path_closed_depth (p) (n):
- p ϵ 𝐂❨n❩ → ♯p + n = ♭p.
-#p #n #Hn elim Hn -Hn //
-#p #n #_ #IH <nplus_succ_dx //
-qed.
(* *)
(**************************************************************************)
-include "delayed_updating/syntax/path_closed_height.ma".
+include "delayed_updating/syntax/path_closed.ma".
include "delayed_updating/syntax/path_structure.ma".
+include "delayed_updating/syntax/path_depth.ma".
(* CLOSED CONDITION FOR PATH ************************************************)
(* Constructions with structure *********************************************)
-lemma path_closed_structure_height (p) (n):
- p ϵ 𝐂❨n❩ → ⊗p ϵ 𝐂❨♯p+n❩.
-#p #n #Hn elim Hn -Hn //
-#p #n #_ #IH [ <nplus_succ_dx ]
+lemma path_closed_structure_depth (p):
+ ⊗p ϵ 𝐂❨♭p❩.
+#p elim p -p // *
/2 width=1 by pcc_L_dx, pcc_A_dx, pcc_S_dx/
qed.
-
-lemma path_closed_structure_depth (p) (n):
- p ϵ 𝐂❨n❩ → ⊗p ϵ 𝐂❨♭p❩.
-#p #n #Hp <path_closed_depth
-/2 width=3 by path_closed_structure_height/
-qed.
[ list_empty ⇒ 𝟎
| list_lcons l q ⇒
match l with
- [ label_d _ ⇒ depth q
- | label_m ⇒ depth q
- | label_L ⇒ ↑(depth q)
- | label_A ⇒ depth q
- | label_S ⇒ depth q
+ [ label_d k ⇒ depth q
+ | label_d2 k d ⇒ depth q
+ | label_m ⇒ depth q
+ | label_L ⇒ ↑(depth q)
+ | label_A ⇒ depth q
+ | label_S ⇒ depth q
]
].
♭p = ♭(p◖𝗱k).
// qed.
+lemma depth_d2_dx (p) (k) (d):
+ ♭p = ♭(p◖𝗱❨k,d❩).
+// qed.
+
lemma depth_m_dx (p):
♭p = ♭(p◖𝗺).
// qed.
theorem depth_append (p) (q):
(♭p)+(♭q) = ♭(p●q).
#p #q elim q -q //
-* [ #k ] #q #IH <list_append_lcons_sn
+* [ #k | #k #d ] #q #IH <list_append_lcons_sn
[ <depth_d_dx <depth_d_dx //
+| <depth_d2_dx <depth_d2_dx //
| <depth_m_dx <depth_m_dx //
| <depth_L_dx <depth_L_dx //
| <depth_A_dx <depth_A_dx //
♭p = ♭(𝗱k◗p).
// qed.
+lemma depth_d2_sn (p) (k) (d):
+ ♭p = ♭(𝗱❨k,d❩◗p).
+// qed.
+
lemma depth_m_sn (p):
♭p = ♭(𝗺◗p).
// 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 "ground/arith/nat_plus.ma".
-include "delayed_updating/syntax/path.ma".
-include "delayed_updating/notation/functions/sharp_1.ma".
-
-(* HEIGHT FOR PATH **********************************************************)
-
-rec definition height (p) on p: nat ≝
-match p with
-[ list_empty ⇒ 𝟎
-| list_lcons l q ⇒
- match l with
- [ label_d k ⇒ height q + k
- | label_m ⇒ height q
- | label_L ⇒ height q
- | label_A ⇒ height q
- | label_S ⇒ height q
- ]
-].
-
-interpretation
- "height (path)"
- 'Sharp p = (height p).
-
-(* Basic constructions ******************************************************)
-
-lemma height_empty: 𝟎 = ♯𝐞.
-// qed.
-
-lemma height_d_dx (p) (k:pnat):
- (♯p)+k = ♯(p◖𝗱k).
-// qed.
-
-lemma height_m_dx (p):
- (♯p) = ♯(p◖𝗺).
-// qed.
-
-lemma height_L_dx (p):
- (♯p) = ♯(p◖𝗟).
-// qed.
-
-lemma height_A_dx (p):
- (♯p) = ♯(p◖𝗔).
-// qed.
-
-lemma height_S_dx (p):
- (♯p) = ♯(p◖𝗦).
-// qed.
-
-(* Main constructions *******************************************************)
-
-theorem height_append (p) (q):
- (♯p+♯q) = ♯(p●q).
-#p #q elim q -q //
-* [ #k ] #q #IH <list_append_lcons_sn
-[ <height_d_dx <height_d_dx //
-| <height_m_dx <height_m_dx //
-| <height_L_dx <height_L_dx //
-| <height_A_dx <height_A_dx //
-| <height_S_dx <height_S_dx //
-]
-qed.
-
-(* Constructions with path_lcons ********************************************)
-
-lemma height_d_sn (p) (k:pnat):
- k+♯p = ♯(𝗱k◗p).
-// qed.
-
-lemma height_m_sn (p):
- ♯p = ♯(𝗺◗p).
-// qed.
-
-lemma height_L_sn (p):
- ♯p = ♯(𝗟◗p).
-// qed.
-
-lemma height_A_sn (p):
- ♯p = ♯(𝗔◗p).
-// qed.
-
-lemma height_S_sn (p):
- ♯p = ♯(𝗦◗p).
-// qed.
include "delayed_updating/syntax/path.ma".
include "delayed_updating/notation/functions/class_i_0.ma".
include "ground/lib/subset.ma".
+include "ground/generated/insert_eq_1.ma".
(* INNER CONDITION FOR PATH *************************************************)
-definition pic: predicate path ≝
- λp. ∀q,k. q◖𝗱k = p → ⊥
+inductive pic: predicate path ≝
+| pic_empty: (𝐞) ϵ pic
+| pic_m_dx (p): p◖𝗺 ϵ pic
+| pic_L_dx (p): p◖𝗟 ϵ pic
+| pic_A_dx (p): p◖𝗔 ϵ pic
+| pic_S_dx (p): p◖𝗦 ϵ pic
.
interpretation
"inner condition (path)"
'ClassI = (pic).
-(* Basic constructions ******************************************************)
-
-lemma pic_empty:
- (𝐞) ϵ 𝐈.
-#q #k #H0 destruct
-qed.
-
-lemma pic_m_dx (p):
- p◖𝗺 ϵ 𝐈.
-#p #q #k #H0 destruct
-qed.
-
-lemma pic_L_dx (p):
- p◖𝗟 ϵ 𝐈.
-#p #q #k #H0 destruct
-qed.
-
-lemma pic_A_dx (p):
- p◖𝗔 ϵ 𝐈.
-#p #q #k #H0 destruct
-qed.
-
-lemma pic_S_dx (p):
- p◖𝗦 ϵ 𝐈.
-#p #q #k #H0 destruct
-qed.
-
(* Basic inversions ********************************************************)
lemma pic_inv_d_dx (p) (k):
p◖𝗱k ϵ 𝐈 → ⊥.
-#p #k #H0 @H0 -H0 //
+#p #k @(insert_eq_1 … (p◖𝗱k))
+#q * -q [|*: #q ] #H0 destruct
+qed-.
+
+lemma pic_inv_d2_dx (p) (k) (d):
+ p◖𝗱❨k,d❩ ϵ 𝐈 → ⊥.
+#p #k #d @(insert_eq_1 … (p◖𝗱❨k,d❩))
+#q * -q [|*: #q ] #H0 destruct
qed-.
(* Constructions with path_lcons ********************************************)
lemma pic_m_sn (p):
p ϵ 𝐈 → 𝗺◗p ϵ 𝐈.
-* [| * [ #k ] #p #Hp <list_cons_shift ] //
-[ #_ <list_cons_comm //
-| elim (pic_inv_d_dx … Hp)
-]
+#p * -p //
qed.
lemma pic_L_sn (p):
p ϵ 𝐈 → 𝗟◗p ϵ 𝐈.
-* [| * [ #k ] #p #Hp <list_cons_shift ] //
-[ #_ <list_cons_comm //
-| elim (pic_inv_d_dx … Hp)
-]
+#p * -p //
qed.
lemma pic_A_sn (p):
p ϵ 𝐈 → 𝗔◗p ϵ 𝐈.
-* [| * [ #k ] #p #Hp <list_cons_shift ] //
-[ #_ <list_cons_comm //
-| elim (pic_inv_d_dx … Hp)
-]
+#p * -p //
qed.
lemma pic_S_sn (p):
p ϵ 𝐈 → 𝗦◗p ϵ 𝐈.
-* [| * [ #k ] #p #Hp <list_cons_shift ] //
-[ #_ <list_cons_comm //
-| elim (pic_inv_d_dx … Hp)
-]
+#p * -p //
qed.
[ list_empty ⇒ 𝐞
| list_lcons l q ⇒
match l with
- [ label_d k ⇒ structure q
- | label_m ⇒ structure q
- | label_L ⇒ (structure q)◖𝗟
- | label_A ⇒ (structure q)◖𝗔
- | label_S ⇒ (structure q)◖𝗦
+ [ label_d k ⇒ structure q
+ | label_d2 k d ⇒ structure q
+ | label_m ⇒ structure q
+ | label_L ⇒ (structure q)◖𝗟
+ | label_A ⇒ (structure q)◖𝗔
+ | label_S ⇒ (structure q)◖𝗦
]
].
⊗p = ⊗(p◖𝗱k).
// qed.
+lemma structure_d2_dx (p) (k) (d):
+ ⊗p = ⊗(p◖𝗱❨k,d❩).
+// qed.
+
lemma structure_m_dx (p):
⊗p = ⊗(p◖𝗺).
// qed.
theorem structure_idem (p):
⊗p = ⊗⊗p.
-#p elim p -p [| * [ #k ] #p #IH ] //
+#p elim p -p //
+* [ #k | #k #d ] #p #IH //
qed.
theorem structure_append (p) (q):
⊗p●⊗q = ⊗(p●q).
-#p #q elim q -q [| * [ #k ] #q #IH ]
-[||*: <list_append_lcons_sn ] //
+#p #q elim q -q //
+* [ #k | #k #d ] #q #IH //
+<list_append_lcons_sn //
qed.
(* Constructions with path_lcons ********************************************)
lemma structure_d_sn (p) (k):
⊗p = ⊗(𝗱k◗p).
-#p #n <structure_append //
+#p #k <structure_append //
+qed.
+
+lemma structure_d2_sn (p) (k) (d):
+ ⊗p = ⊗(𝗱❨k,d❩◗p).
+#p #k #d <structure_append //
qed.
lemma structure_m_sn (p):
lemma eq_inv_d_dx_structure (h) (q) (p):
q◖𝗱h = ⊗p → ⊥.
-#h #q #p elim p -p [| * [ #k ] #p #IH ]
+#h #q #p elim p -p [| * [ #k | #k #d ] #p #IH ]
[ <structure_empty #H0 destruct
| <structure_d_dx #H0 /2 width=1 by/
+| <structure_d2_dx #H0 /2 width=1 by/
+| <structure_m_dx #H0 /2 width=1 by/
+| <structure_L_dx #H0 destruct
+| <structure_A_dx #H0 destruct
+| <structure_S_dx #H0 destruct
+]
+qed-.
+
+lemma eq_inv_d2_dx_structure (d) (h) (q) (p):
+ q◖𝗱❨h,d❩ = ⊗p → ⊥.
+#d #h #q #p elim p -p [| * [ #k | #k #d ] #p #IH ]
+[ <structure_empty #H0 destruct
+| <structure_d_dx #H0 /2 width=1 by/
+| <structure_d2_dx #H0 /2 width=1 by/
| <structure_m_dx #H0 /2 width=1 by/
| <structure_L_dx #H0 destruct
| <structure_A_dx #H0 destruct
lemma eq_inv_m_dx_structure (q) (p):
q◖𝗺 = ⊗p → ⊥.
-#q #p elim p -p [| * [ #k ] #p #IH ]
+#q #p elim p -p [| * [ #k | #k #d ] #p #IH ]
[ <structure_empty #H0 destruct
| <structure_d_dx #H0 /2 width=1 by/
+| <structure_d2_dx #H0 /2 width=1 by/
| <structure_m_dx #H0 /2 width=1 by/
| <structure_L_dx #H0 destruct
| <structure_A_dx #H0 destruct
lemma eq_inv_L_dx_structure (q) (p):
q◖𝗟 = ⊗p →
∃∃r1,r2. q = ⊗r1 & 𝐞 = ⊗r2 & r1●𝗟◗r2 = p.
-#q #p elim p -p [| * [ #k ] #p #IH ]
+#q #p elim p -p [| * [ #k | #k #d ] #p #IH ]
[ <structure_empty #H0 destruct
| <structure_d_dx #H0
elim IH -IH // -H0 #r1 #r2 #H1 #H0 #H2 destruct
/2 width=5 by ex3_2_intro/
+| <structure_d2_dx #H0
+ elim IH -IH // -H0 #r1 #r2 #H1 #H0 #H2 destruct
+ /2 width=5 by ex3_2_intro/
| <structure_m_dx #H0
elim IH -IH // -H0 #r1 #r2 #H1 #H0 #H2 destruct
/2 width=5 by ex3_2_intro/
lemma eq_inv_A_dx_structure (q) (p):
q◖𝗔 = ⊗p →
∃∃r1,r2. q = ⊗r1 & 𝐞 = ⊗r2 & r1●𝗔◗r2 = p.
-#q #p elim p -p [| * [ #k ] #p #IH ]
+#q #p elim p -p [| * [ #k | #k #d ] #p #IH ]
[ <structure_empty #H0 destruct
| <structure_d_dx #H0
elim IH -IH // -H0 #r1 #r2 #H1 #H0 #H2 destruct
/2 width=5 by ex3_2_intro/
+| <structure_d2_dx #H0
+ elim IH -IH // -H0 #r1 #r2 #H1 #H0 #H2 destruct
+ /2 width=5 by ex3_2_intro/
| <structure_m_dx #H0
elim IH -IH // -H0 #r1 #r2 #H1 #H0 #H2 destruct
/2 width=5 by ex3_2_intro/
lemma eq_inv_S_dx_structure (q) (p):
q◖𝗦 = ⊗p →
∃∃r1,r2. q = ⊗r1 & 𝐞 = ⊗r2 & r1●𝗦◗r2 = p.
-#q #p elim p -p [| * [ #k ] #p #IH ]
+#q #p elim p -p [| * [ #k | #k #d ] #p #IH ]
[ <structure_empty #H0 destruct
| <structure_d_dx #H0
elim IH -IH // -H0 #r1 #r2 #H1 #H0 #H2 destruct
/2 width=5 by ex3_2_intro/
+| <structure_d2_dx #H0
+ elim IH -IH // -H0 #r1 #r2 #H1 #H0 #H2 destruct
+ /2 width=5 by ex3_2_intro/
| <structure_m_dx #H0
elim IH -IH // -H0 #r1 #r2 #H1 #H0 #H2 destruct
/2 width=5 by ex3_2_intro/
theorem eq_inv_append_structure (p) (q) (r):
p●q = ⊗r →
∃∃r1,r2.p = ⊗r1 & q = ⊗r2 & r1●r2 = r.
-#p #q elim q -q [| * [ #k ] #q #IH ] #r
+#p #q elim q -q [| * [ #k | #k #d ] #q #IH ] #r
[ <list_append_empty_sn #H0 destruct
/2 width=5 by ex3_2_intro/
| #H0 elim (eq_inv_d_dx_structure … H0)
+| #H0 elim (eq_inv_d2_dx_structure … H0)
| #H0 elim (eq_inv_m_dx_structure … H0)
| #H0 elim (eq_inv_L_dx_structure … H0) -H0 #r1 #r2 #Hr1 #Hr2 #H0 destruct
elim (IH … Hr1) -IH -Hr1 #s1 #s2 #H1 #H2 #H3 destruct
elim (eq_inv_d_dx_structure … H0)
qed-.
+lemma eq_inv_d2_sn_structure (d) (h) (q) (p):
+ (𝗱❨h,d❩◗q) = ⊗p → ⊥.
+#d #h #q #p >list_cons_comm #H0
+elim (eq_inv_append_structure … H0) -H0 #r1 #r2
+<list_cons_comm #H0 #H1 #H2 destruct
+elim (eq_inv_d2_dx_structure … H0)
+qed-.
+
lemma eq_inv_m_sn_structure (q) (p):
(𝗺 ◗q) = ⊗p → ⊥.
#q #p >list_cons_comm #H0
⊗p ϵ 𝐈.
#p elim p -p
[ <structure_empty //
-| * [ #k ] #p #IH
+| * [ #k | #k #d ] #p #IH
[ <structure_d_dx //
+ | <structure_d2_dx //
| <structure_m_dx //
| <structure_L_dx //
| <structure_A_dx //
include "delayed_updating/notation/functions/m_hook_1.ma".
include "delayed_updating/notation/functions/hash_1.ma".
include "delayed_updating/notation/functions/tau_2.ma".
+include "delayed_updating/notation/functions/tau_3.ma".
include "delayed_updating/notation/functions/lamda_1.ma".
include "delayed_updating/notation/functions/at_2.ma".
"inner variable reference by depth (prototerm)"
'Tau k t = (prototerm_node_1_2 (label_d k) label_m t).
+interpretation
+ "inner variable reference by depth with offset (prototerm)"
+ 'Tau k d t = (prototerm_node_1_2 (label_d2 k d) label_m t).
+
interpretation
"name-free functional abstraction (prototerm)"
'Lamda t = (prototerm_node_1 label_L t).
q ϵ t → 𝗱k◗𝗺◗q ϵ 𝛕k.t.
/2 width=3 by ex2_intro/ qed.
+lemma in_comp_iref2 (t) (q) (k) (d):
+ q ϵ t → 𝗱❨k,d❩◗𝗺◗q ϵ 𝛕❨k,d❩.t.
+/2 width=3 by ex2_intro/ qed.
+
(* Basic inversions *********************************************************)
lemma in_comp_inv_iref (t) (p) (k):
/2 width=3 by ex2_intro/
qed-.
+lemma in_comp_inv_iref2 (t) (p) (k) (d):
+ p ϵ 𝛕❨k,d❩.t →
+ ∃∃q. 𝗱❨k,d❩◗𝗺◗q = p & q ϵ t.
+#t #p #k #d * #q #Hq #Hp
+/2 width=3 by ex2_intro/
+qed-.
+
(* COMMENT
lemma prototerm_in_root_inv_lcons_oref:
∀p,l,n. l◗p ϵ ▵#n →
(𝛕k.t) ϵ 𝐏.
#t #k #p * #q #Hq #H0 destruct //
qed.
+
+lemma ppc_iref2 (t) (k) (d):
+ (𝛕❨k,d❩.t) ϵ 𝐏.
+#t #k #d #p * #q #Hq #H0 destruct //
+qed.
projects / helm.git / commitdiff