---

Step * 1 of Lemma per-type-family_wf


1. A : Type
2. B : Type supposing A
⊢ λx.B ∈ per-function(A;a.Type)
BY
{ Assert ⌜per-function(A;a.Type) ∈ 𝕌'⌝⋅ }

1
.....assertion..... 
1. A : Type
2. B : Type supposing A
⊢ per-function(A;a.Type) ∈ 𝕌'

2
1. A : Type
2. B : Type supposing A
3. per-function(A;a.Type) ∈ 𝕌'
⊢ λx.B ∈ per-function(A;a.Type)

---

Latex:

---

Latex:

1.  A  :  Type
2.  B  :  Type  supposing  A
\mvdash{}  \mlambda{}x.B  \mmember{}  per-function(A;a.Type)


By

---

Latex:
Assert  \mkleeneopen{}per-function(A;a.Type)  \mmember{}  \mBbbU{}'\mkleeneclose{}\mcdot{}

---

Home Index