---

Step * of Lemma Sierpinski-equal-bottom

∀[x:ℕ ⟶ 𝔹]. uiff(x = ⊥ ∈ Sierpinski;x = ⊥ ∈ (ℕ ⟶ 𝔹))
BY
{ (Auto THEN EqTypeHD (-1) THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[x:\mBbbN{}  {}\mrightarrow{}  \mBbbB{}].  uiff(x  =  \mbot{};x  =  \mbot{})


By

---

Latex:
(Auto  THEN  EqTypeHD  (-1)  THEN  Auto)

---

Home Index