---

Step * 2 1 of Lemma wfd-tree-cases


1. [A] : Type
2. w : wfd-tree(A)
3. ¬↑co-w-null(w)
4. wfd-subtrees(w) ∈ A ⟶ wfd-tree(A)
⊢ (w = w-nil() ∈ wfd-tree(A)) ∨ ((¬↑co-w-null(w)) ∧ (w = mk-wfd-tree(wfd-subtrees(w)) ∈ wfd-tree(A)))
BY
{ (OrRight THEN Auto) }

1
1. A : Type
2. w : wfd-tree(A)
3. ¬↑co-w-null(w)
4. wfd-subtrees(w) ∈ A ⟶ wfd-tree(A)
5. ¬↑co-w-null(w)
⊢ w = mk-wfd-tree(wfd-subtrees(w)) ∈ wfd-tree(A)

---

Latex:

---

Latex:

1.  [A]  :  Type
2.  w  :  wfd-tree(A)
3.  \mneg{}\muparrow{}co-w-null(w)
4.  wfd-subtrees(w)  \mmember{}  A  {}\mrightarrow{}  wfd-tree(A)
\mvdash{}  (w  =  w-nil())  \mvee{}  ((\mneg{}\muparrow{}co-w-null(w))  \mwedge{}  (w  =  mk-wfd-tree(wfd-subtrees(w))))


By

---

Latex:
(OrRight  THEN  Auto)

---

Home Index