| 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 12507 | . 2 ⊢ (𝑁 ∈ ℕ0* ↔ (𝑁 ∈ ℕ0 ∨ 𝑁 = +∞)) | |
| 2 | nn0n0n1ge2b 12501 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) | |
| 3 | 0nn0 12447 | . . . . . . . 8 ⊢ 0 ∈ ℕ0 | |
| 4 | nn0nepnf 12513 | . . . . . . . 8 ⊢ (0 ∈ ℕ0 → 0 ≠ +∞) | |
| 5 | 3, 4 | ax-mp 5 | . . . . . . 7 ⊢ 0 ≠ +∞ |
| 6 | 5 | necomi 2987 | . . . . . 6 ⊢ +∞ ≠ 0 |
| 7 | neeq1 2995 | . . . . . 6 ⊢ (𝑁 = +∞ → (𝑁 ≠ 0 ↔ +∞ ≠ 0)) | |
| 8 | 6, 7 | mpbiri 258 | . . . . 5 ⊢ (𝑁 = +∞ → 𝑁 ≠ 0) |
| 9 | 1nn0 12448 | . . . . . . . 8 ⊢ 1 ∈ ℕ0 | |
| 10 | nn0nepnf 12513 | . . . . . . . 8 ⊢ (1 ∈ ℕ0 → 1 ≠ +∞) | |
| 11 | 9, 10 | ax-mp 5 | . . . . . . 7 ⊢ 1 ≠ +∞ |
| 12 | 11 | necomi 2987 | . . . . . 6 ⊢ +∞ ≠ 1 |
| 13 | neeq1 2995 | . . . . . 6 ⊢ (𝑁 = +∞ → (𝑁 ≠ 1 ↔ +∞ ≠ 1)) | |
| 14 | 12, 13 | mpbiri 258 | . . . . 5 ⊢ (𝑁 = +∞ → 𝑁 ≠ 1) |
| 15 | 8, 14 | jca 511 | . . . 4 ⊢ (𝑁 = +∞ → (𝑁 ≠ 0 ∧ 𝑁 ≠ 1)) |
| 16 | 2re 12250 | . . . . . . 7 ⊢ 2 ∈ ℝ | |
| 17 | 16 | rexri 11198 | . . . . . 6 ⊢ 2 ∈ ℝ* |
| 18 | pnfge 13076 | . . . . . 6 ⊢ (2 ∈ ℝ* → 2 ≤ +∞) | |
| 19 | 17, 18 | ax-mp 5 | . . . . 5 ⊢ 2 ≤ +∞ |
| 20 | breq2 5090 | . . . . 5 ⊢ (𝑁 = +∞ → (2 ≤ 𝑁 ↔ 2 ≤ +∞)) | |
| 21 | 19, 20 | mpbiri 258 | . . . 4 ⊢ (𝑁 = +∞ → 2 ≤ 𝑁) |
| 22 | 15, 21 | 2thd 265 | . . 3 ⊢ (𝑁 = +∞ → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| 23 | 2, 22 | jaoi 858 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∨ 𝑁 = +∞) → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| 24 | 1, 23 | sylbi 217 | 1 ⊢ (𝑁 ∈ ℕ0* → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 class class class wbr 5086 0cc0 11033 1c1 11034 +∞cpnf 11171 ℝ*cxr 11173 ≤ cle 11175 2c2 12231 ℕ0cn0 12432 ℕ0*cxnn0 12505 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5521 df-eprel 5526 df-po 5534 df-so 5535 df-fr 5579 df-we 5581 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-pred 6261 df-ord 6322 df-on 6323 df-lim 6324 df-suc 6325 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-om 7813 df-2nd 7938 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-er 8638 df-en 8889 df-dom 8890 df-sdom 8891 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-n0 12433 df-xnn0 12506 |
| This theorem is referenced by: vdgfrgrgt2 30387 xnn01gt 32862 lfuhgr2 35321 |
| Copyright terms: Public domain | W3C validator |