| 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 12480 | . 2 ⊢ (𝑁 ∈ ℕ0* ↔ (𝑁 ∈ ℕ0 ∨ 𝑁 = +∞)) | |
| 2 | nn0n0n1ge2b 12474 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) | |
| 3 | 0nn0 12420 | . . . . . . . 8 ⊢ 0 ∈ ℕ0 | |
| 4 | nn0nepnf 12486 | . . . . . . . 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 12421 | . . . . . . . 8 ⊢ 1 ∈ ℕ0 | |
| 10 | nn0nepnf 12486 | . . . . . . . 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 12223 | . . . . . . 7 ⊢ 2 ∈ ℝ | |
| 17 | 16 | rexri 11194 | . . . . . 6 ⊢ 2 ∈ ℝ* |
| 18 | pnfge 13048 | . . . . . 6 ⊢ (2 ∈ ℝ* → 2 ≤ +∞) | |
| 19 | 17, 18 | ax-mp 5 | . . . . 5 ⊢ 2 ≤ +∞ |
| 20 | breq2 5103 | . . . . 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 5099 0cc0 11030 1c1 11031 +∞cpnf 11167 ℝ*cxr 11169 ≤ cle 11171 2c2 12204 ℕ0cn0 12405 ℕ0*cxnn0 12478 |
| 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 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| 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 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-n0 12406 df-xnn0 12479 |
| This theorem is referenced by: vdgfrgrgt2 30377 xnn01gt 32852 lfuhgr2 35315 |
| Copyright terms: Public domain | W3C validator |