---

Step * 1 1 1 of Lemma wfd-tree-cases

.....equality..... 
1. A : Type
2. w : wfd-tree(A)
3. ↑co-w-null(w)
⊢ w ~ w-nil()
BY
{ (MoveToConcl (-1)
   THEN (InstLemma `co-w-ext` [A]⋅ THENA Auto)
   THEN (GenConcl ⌜w = z ∈ (Unit + (A ⟶ co-w(A)))⌝⋅ THENA Auto)
   THEN ThinVar `w'
   THEN D (-1)
   THEN RepUR ``co-w-null`` 0
   THEN Auto)⋅ }

1
1. A : Type
2. co-w(A) ≡ Unit + (A ⟶ co-w(A))
3. x : Unit
4. True
⊢ inl x ~ w-nil()

---

Latex:

---

Latex:
.....equality..... 
1.  A  :  Type
2.  w  :  wfd-tree(A)
3.  \muparrow{}co-w-null(w)
\mvdash{}  w  \msim{}  w-nil()


By

---

Latex:
(MoveToConcl  (-1)
  THEN  (InstLemma  `co-w-ext`  [A]\mcdot{}  THENA  Auto)
  THEN  (GenConcl  \mkleeneopen{}w  =  z\mkleeneclose{}\mcdot{}  THENA  Auto)
  THEN  ThinVar  `w'
  THEN  D  (-1)
  THEN  RepUR  ``co-w-null``  0
  THEN  Auto)\mcdot{}

---

Home Index