---

Step * 1 of Lemma valueall-type-has-valueall


1. T : Type
2. valueall-type(T)
3. x : T
⊢ has-valueall(x)
BY
{ Unfold `valueall-type` 2 }

1
1. T : Type
2. ∀[x:Base]. (evalall(x))↓ supposing x ∈ T
3. x : T
⊢ has-valueall(x)

---

Latex:

---

Latex:

1.  T  :  Type
2.  valueall-type(T)
3.  x  :  T
\mvdash{}  has-valueall(x)


By

---

Latex:
Unfold  `valueall-type`  2

---

Home Index