| 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 12579 | . 2 ⊢ (𝑁 ∈ ℕ0* ↔ (𝑁 ∈ ℕ0 ∨ 𝑁 = +∞)) | |
| 2 | nn0n0n1ge2b 12573 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) | |
| 3 | 0nn0 12519 | . . . . . . . 8 ⊢ 0 ∈ ℕ0 | |
| 4 | nn0nepnf 12585 | . . . . . . . 8 ⊢ (0 ∈ ℕ0 → 0 ≠ +∞) | |
| 5 | 3, 4 | ax-mp 5 | . . . . . . 7 ⊢ 0 ≠ +∞ |
| 6 | 5 | necomi 3018 | . . . . . 6 ⊢ +∞ ≠ 0 |
| 7 | neeq1 3026 | . . . . . 6 ⊢ (𝑁 = +∞ → (𝑁 ≠ 0 ↔ +∞ ≠ 0)) | |
| 8 | 6, 7 | mpbiri 261 | . . . . 5 ⊢ (𝑁 = +∞ → 𝑁 ≠ 0) |
| 9 | 1nn0 12520 | . . . . . . . 8 ⊢ 1 ∈ ℕ0 | |
| 10 | nn0nepnf 12585 | . . . . . . . 8 ⊢ (1 ∈ ℕ0 → 1 ≠ +∞) | |
| 11 | 9, 10 | ax-mp 5 | . . . . . . 7 ⊢ 1 ≠ +∞ |
| 12 | 11 | necomi 3018 | . . . . . 6 ⊢ +∞ ≠ 1 |
| 13 | neeq1 3026 | . . . . . 6 ⊢ (𝑁 = +∞ → (𝑁 ≠ 1 ↔ +∞ ≠ 1)) | |
| 14 | 12, 13 | mpbiri 261 | . . . . 5 ⊢ (𝑁 = +∞ → 𝑁 ≠ 1) |
| 15 | 8, 14 | jca 520 | . . . 4 ⊢ (𝑁 = +∞ → (𝑁 ≠ 0 ∧ 𝑁 ≠ 1)) |
| 16 | 2re 12315 | . . . . . . 7 ⊢ 2 ∈ ℝ | |
| 17 | 16 | rexri 11267 | . . . . . 6 ⊢ 2 ∈ ℝ* |
| 18 | pnfge 13155 | . . . . . 6 ⊢ (2 ∈ ℝ* → 2 ≤ +∞) | |
| 19 | 17, 18 | ax-mp 5 | . . . . 5 ⊢ 2 ≤ +∞ |
| 20 | breq2 5115 | . . . . 5 ⊢ (𝑁 = +∞ → (2 ≤ 𝑁 ↔ 2 ≤ +∞)) | |
| 21 | 19, 20 | mpbiri 261 | . . . 4 ⊢ (𝑁 = +∞ → 2 ≤ 𝑁) |
| 22 | 15, 21 | 2thd 268 | . . 3 ⊢ (𝑁 = +∞ → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| 23 | 2, 22 | jaoi 870 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∨ 𝑁 = +∞) → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| 24 | 1, 23 | sylbi 220 | 1 ⊢ (𝑁 ∈ ℕ0* → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 class class class wbr 5111 0cc0 11100 1c1 11101 +∞cpnf 11240 ℝ*cxr 11242 ≤ cle 11244 2c2 12295 ℕ0cn0 12504 ℕ0*cxnn0 12577 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-n0 12505 df-xnn0 12578 |
| This theorem is referenced by: vdgfrgrgt2 30590 xnn01gt 33056 lfuhgr2 35544 |
| Copyright terms: Public domain | W3C validator |