---

Step * of Lemma compact-nat-inf

∀p:ℕ∞ ⟶ 𝔹. ((∃x:ℕ∞. p x = ff) ∨ (∀x:ℕ∞. p x = tt))
BY
{ (Auto THEN SimpleBoolCase ⌜p ni-selector(p)⌝⋅ THEN Auto) }

1
1. p : ℕ∞ ⟶ 𝔹
2. p ni-selector(p) = tt
⊢ (∃x:ℕ∞. p x = ff) ∨ (∀x:ℕ∞. p x = tt)

---

Latex:

---

Latex:
\mforall{}p:\mBbbN{}\minfty{}  {}\mrightarrow{}  \mBbbB{}.  ((\mexists{}x:\mBbbN{}\minfty{}.  p  x  =  ff)  \mvee{}  (\mforall{}x:\mBbbN{}\minfty{}.  p  x  =  tt))


By

---

Latex:
(Auto  THEN  SimpleBoolCase  \mkleeneopen{}p  ni-selector(p)\mkleeneclose{}\mcdot{}  THEN  Auto)

---

Home Index