Step
*
1
1
of Lemma
sq_stable__ex_int_upper
.....assertion.....
1. n : ℤ
2. P : {n...} ⟶ ℙ
3. d : ∀m:{n...}. Dec(P[m])
4. ∃m:{n...}. P[m]
5. P[mu-ge(d;n)] ∧ (∀[i:{n..mu-ge(d;n)-}]. (¬P[i]))
⊢ mu-ge(d;n) ∈ {n...}
BY
{ (BLemma `mu-ge_wf2` THEN Auto) }
1
1. n : ℤ
2. P : {n...} ⟶ ℙ
3. d : ∀m:{n...}. Dec(P[m])
4. ∃m:{n...}. P[m]
5. P[mu-ge(d;n)]
6. ∀[i:{n..mu-ge(d;n)-}]. (¬P[i])
⊢ ∃m:{n...}. (↑isl(d m))
Latex:
Latex:
.....assertion.....
1. n : \mBbbZ{}
2. P : \{n...\} {}\mrightarrow{} \mBbbP{}
3. d : \mforall{}m:\{n...\}. Dec(P[m])
4. \mexists{}m:\{n...\}. P[m]
5. P[mu-ge(d;n)] \mwedge{} (\mforall{}[i:\{n..mu-ge(d;n)\msupminus{}\}]. (\mneg{}P[i]))
\mvdash{} mu-ge(d;n) \mmember{} \{n...\}
By
Latex:
(BLemma `mu-ge\_wf2` THEN Auto)
Home
Index