---

Step * of Lemma singleton-type-void-domain

∀[A:Type]. ∀[B:A ⟶ Type].  singleton-type(a:A ⟶ B[a]) supposing ¬A
BY
{ (Auto THEN With ⌜λx.⋅⌝ (D 0)⋅ THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[A:Type].  \mforall{}[B:A  {}\mrightarrow{}  Type].    singleton-type(a:A  {}\mrightarrow{}  B[a])  supposing  \mneg{}A


By

---

Latex:
(Auto  THEN  With  \mkleeneopen{}\mlambda{}x.\mcdot{}\mkleeneclose{}  (D  0)\mcdot{}  THEN  Auto)

---

Home Index