| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xnn0n0n1ge2b | Structured version Visualization version GIF version | ||
| Description: An extended nonnegative integer is neither 0 nor 1 if and only if it is greater than or equal to 2. (Contributed by AV, 5-Apr-2021.) |
| Ref | Expression |
|---|---|
| xnn0n0n1ge2b | ⊢ (𝑁 ∈ ℕ0* → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxnn0 12681 | . 2 ⊢ (𝑁 ∈ ℕ0* ↔ (𝑁 ∈ ℕ0 ∨ 𝑁 = +∞)) | |
| 2 | nn0n0n1ge2b 12675 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) | |
| 3 | 0nn0 12621 | . . . . . . . 8 ⊢ 0 ∈ ℕ0 | |
| 4 | nn0nepnf 12687 | . . . . . . . 8 ⊢ (0 ∈ ℕ0 → 0 ≠ +∞) | |
| 5 | 3, 4 | ax-mp 5 | . . . . . . 7 ⊢ 0 ≠ +∞ |
| 6 | 5 | necomi 3009 | . . . . . 6 ⊢ +∞ ≠ 0 |
| 7 | neeq1 3017 | . . . . . 6 ⊢ (𝑁 = +∞ → (𝑁 ≠ 0 ↔ +∞ ≠ 0)) | |
| 8 | 6, 7 | mpbiri 261 | . . . . 5 ⊢ (𝑁 = +∞ → 𝑁 ≠ 0) |
| 9 | 1nn0 12622 | . . . . . . . 8 ⊢ 1 ∈ ℕ0 | |
| 10 | nn0nepnf 12687 | . . . . . . . 8 ⊢ (1 ∈ ℕ0 → 1 ≠ +∞) | |
| 11 | 9, 10 | ax-mp 5 | . . . . . . 7 ⊢ 1 ≠ +∞ |
| 12 | 11 | necomi 3009 | . . . . . 6 ⊢ +∞ ≠ 1 |
| 13 | neeq1 3017 | . . . . . 6 ⊢ (𝑁 = +∞ → (𝑁 ≠ 1 ↔ +∞ ≠ 1)) | |
| 14 | 12, 13 | mpbiri 261 | . . . . 5 ⊢ (𝑁 = +∞ → 𝑁 ≠ 1) |
| 15 | 8, 14 | jca 521 | . . . 4 ⊢ (𝑁 = +∞ → (𝑁 ≠ 0 ∧ 𝑁 ≠ 1)) |
| 16 | 2re 12417 | . . . . . . 7 ⊢ 2 ∈ ℝ | |
| 17 | 16 | rexri 11367 | . . . . . 6 ⊢ 2 ∈ ℝ* |
| 18 | pnfge 13259 | . . . . . 6 ⊢ (2 ∈ ℝ* → 2 ≤ +∞) | |
| 19 | 17, 18 | ax-mp 5 | . . . . 5 ⊢ 2 ≤ +∞ |
| 20 | breq2 5106 | . . . . 5 ⊢ (𝑁 = +∞ → (2 ≤ 𝑁 ↔ 2 ≤ +∞)) | |
| 21 | 19, 20 | mpbiri 261 | . . . 4 ⊢ (𝑁 = +∞ → 2 ≤ 𝑁) |
| 22 | 15, 21 | 2thd 268 | . . 3 ⊢ (𝑁 = +∞ → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| 23 | 2, 22 | jaoi 871 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∨ 𝑁 = +∞) → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| 24 | 1, 23 | sylbi 220 | 1 ⊢ (𝑁 ∈ ℕ0* → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 class class class wbr 5102 0cc0 11200 1c1 11201 +∞cpnf 11340 ℝ*cxr 11342 ≤ cle 11344 2c2 12397 ℕ0cn0 12606 ℕ0*cxnn0 12679 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-n0 12607 df-xnn0 12680 |
| This theorem is used by: lfuhgr2 29727 vdgfrgrgt2 30899 xnn01gt 33362 |
| Copyright terms: Public domain | W3C validator |