| 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 12606 | . 2 ⊢ (𝑁 ∈ ℕ0* ↔ (𝑁 ∈ ℕ0 ∨ 𝑁 = +∞)) | |
| 2 | nn0n0n1ge2b 12600 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 ≠ 0 ∧ 𝑁 ≠ 1) ↔ 2 ≤ 𝑁)) | |
| 3 | 0nn0 12546 | . . . . . . . 8 ⊢ 0 ∈ ℕ0 | |
| 4 | nn0nepnf 12612 | . . . . . . . 8 ⊢ (0 ∈ ℕ0 → 0 ≠ +∞) | |
| 5 | 3, 4 | ax-mp 5 | . . . . . . 7 ⊢ 0 ≠ +∞ |
| 6 | 5 | necomi 3011 | . . . . . 6 ⊢ +∞ ≠ 0 |
| 7 | neeq1 3019 | . . . . . 6 ⊢ (𝑁 = +∞ → (𝑁 ≠ 0 ↔ +∞ ≠ 0)) | |
| 8 | 6, 7 | mpbiri 261 | . . . . 5 ⊢ (𝑁 = +∞ → 𝑁 ≠ 0) |
| 9 | 1nn0 12547 | . . . . . . . 8 ⊢ 1 ∈ ℕ0 | |
| 10 | nn0nepnf 12612 | . . . . . . . 8 ⊢ (1 ∈ ℕ0 → 1 ≠ +∞) | |
| 11 | 9, 10 | ax-mp 5 | . . . . . . 7 ⊢ 1 ≠ +∞ |
| 12 | 11 | necomi 3011 | . . . . . 6 ⊢ +∞ ≠ 1 |
| 13 | neeq1 3019 | . . . . . 6 ⊢ (𝑁 = +∞ → (𝑁 ≠ 1 ↔ +∞ ≠ 1)) | |
| 14 | 12, 13 | mpbiri 261 | . . . . 5 ⊢ (𝑁 = +∞ → 𝑁 ≠ 1) |
| 15 | 8, 14 | jca 521 | . . . 4 ⊢ (𝑁 = +∞ → (𝑁 ≠ 0 ∧ 𝑁 ≠ 1)) |
| 16 | 2re 12342 | . . . . . . 7 ⊢ 2 ∈ ℝ | |
| 17 | 16 | rexri 11294 | . . . . . 6 ⊢ 2 ∈ ℝ* |
| 18 | pnfge 13183 | . . . . . 6 ⊢ (2 ∈ ℝ* → 2 ≤ +∞) | |
| 19 | 17, 18 | ax-mp 5 | . . . . 5 ⊢ 2 ≤ +∞ |
| 20 | breq2 5111 | . . . . 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 1570 ∈ wcel 2145 ≠ wne 2957 class class class wbr 5107 0cc0 11127 1c1 11128 +∞cpnf 11267 ℝ*cxr 11269 ≤ cle 11271 2c2 12322 ℕ0cn0 12531 ℕ0*cxnn0 12604 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-n0 12532 df-xnn0 12605 |
| This theorem is used by: lfuhgr2 29592 vdgfrgrgt2 30764 xnn01gt 33228 |
| Copyright terms: Public domain | W3C validator |