---

Step * of Lemma function-eq_wf

∀[A:Type]. ∀[B:Base].  ∀[f,g:Base].  (function-eq(A;a.B[a];f;g) ∈ Type) supposing base-type-family{i:l}(A;a.B[a])
BY
{ (Auto THEN Unfold `function-eq` 0 THEN InstLemma `base-type-family-implies` [⌜A⌝;⌜B⌝]⋅ THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[A:Type].  \mforall{}[B:Base].
    \mforall{}[f,g:Base].    (function-eq(A;a.B[a];f;g)  \mmember{}  Type)  supposing  base-type-family\{i:l\}(A;a.B[a])


By

---

Latex:
(Auto  THEN  Unfold  `function-eq`  0  THEN  InstLemma  `base-type-family-implies`  [\mkleeneopen{}A\mkleeneclose{};\mkleeneopen{}B\mkleeneclose{}]\mcdot{}  THEN  Auto)

---

Home Index