Step
*
1
of Lemma
mu-bound-property+
1. [b] : ℕ
2. [f] : ℕb ⟶ 𝔹
3. [%] : ∃n:ℕb. (↑(f n))
4. ↑(f mu(f))
5. ∀[i:ℕb]. ¬↑(f i) supposing i < mu(f)
⊢ mu(f) ∈ ℕb
BY
{ (BLemma `mu-bound` THEN Auto)⋅ }
Latex:
Latex:
1. [b] : \mBbbN{}
2. [f] : \mBbbN{}b {}\mrightarrow{} \mBbbB{}
3. [\%] : \mexists{}n:\mBbbN{}b. (\muparrow{}(f n))
4. \muparrow{}(f mu(f))
5. \mforall{}[i:\mBbbN{}b]. \mneg{}\muparrow{}(f i) supposing i < mu(f)
\mvdash{} mu(f) \mmember{} \mBbbN{}b
By
Latex:
(BLemma `mu-bound` THEN Auto)\mcdot{}
Home
Index