| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nn0o | Structured version Visualization version GIF version | ||
| Description: An alternate characterization of an odd nonnegative integer. (Contributed by AV, 28-May-2020.) (Proof shortened by AV, 2-Jun-2020.) |
| Ref | Expression |
|---|---|
| nn0o | ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0o1gt2 16551 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → (𝑁 = 1 ∨ 2 < 𝑁)) | |
| 2 | 1m1e0 12415 | . . . . . . . 8 ⊢ (1 − 1) = 0 | |
| 3 | 2 | oveq1i 7430 | . . . . . . 7 ⊢ ((1 − 1) / 2) = (0 / 2) |
| 4 | 2cn 12418 | . . . . . . . 8 ⊢ 2 ∈ ℂ | |
| 5 | 2ne0 12449 | . . . . . . . 8 ⊢ 2 ≠ 0 | |
| 6 | 4, 5 | div0i 12051 | . . . . . . 7 ⊢ (0 / 2) = 0 |
| 7 | 3, 6 | eqtri 2784 | . . . . . 6 ⊢ ((1 − 1) / 2) = 0 |
| 8 | 0nn0 12621 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 9 | 7, 8 | eqeltri 2857 | . . . . 5 ⊢ ((1 − 1) / 2) ∈ ℕ0 |
| 10 | oveq1 7427 | . . . . . . . 8 ⊢ (𝑁 = 1 → (𝑁 − 1) = (1 − 1)) | |
| 11 | 10 | oveq1d 7435 | . . . . . . 7 ⊢ (𝑁 = 1 → ((𝑁 − 1) / 2) = ((1 − 1) / 2)) |
| 12 | 11 | eleq1d 2846 | . . . . . 6 ⊢ (𝑁 = 1 → (((𝑁 − 1) / 2) ∈ ℕ0 ↔ ((1 − 1) / 2) ∈ ℕ0)) |
| 13 | 12 | adantr 486 | . . . . 5 ⊢ ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → (((𝑁 − 1) / 2) ∈ ℕ0 ↔ ((1 − 1) / 2) ∈ ℕ0)) |
| 14 | 9, 13 | mpbiri 261 | . . . 4 ⊢ ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → ((𝑁 − 1) / 2) ∈ ℕ0) |
| 15 | 14 | ex 418 | . . 3 ⊢ (𝑁 = 1 → ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0)) |
| 16 | 2z 12728 | . . . . . . . 8 ⊢ 2 ∈ ℤ | |
| 17 | 16 | a1i 11 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 2 ∈ ℤ) |
| 18 | nn0z 12717 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 19 | 18 | ad2antrl 741 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 𝑁 ∈ ℤ) |
| 20 | 2re 12417 | . . . . . . . . . 10 ⊢ 2 ∈ ℝ | |
| 21 | nn0re 12615 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 22 | ltle 11398 | . . . . . . . . . 10 ⊢ ((2 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (2 < 𝑁 → 2 ≤ 𝑁)) | |
| 23 | 20, 21, 22 | sylancr 599 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → (2 < 𝑁 → 2 ≤ 𝑁)) |
| 24 | 23 | adantr 486 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → (2 < 𝑁 → 2 ≤ 𝑁)) |
| 25 | 24 | impcom 413 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 2 ≤ 𝑁) |
| 26 | eluz2 12971 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 2 ≤ 𝑁)) | |
| 27 | 17, 19, 25, 26 | syl3anbrc 1362 | . . . . . 6 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 𝑁 ∈ (ℤ≥‘2)) |
| 28 | simprr 785 | . . . . . 6 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → ((𝑁 + 1) / 2) ∈ ℕ0) | |
| 29 | 27, 28 | jca 521 | . . . . 5 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → (𝑁 ∈ (ℤ≥‘2) ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) |
| 30 | nno 16552 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘2) ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ) | |
| 31 | nnnn0 12613 | . . . . 5 ⊢ (((𝑁 − 1) / 2) ∈ ℕ → ((𝑁 − 1) / 2) ∈ ℕ0) | |
| 32 | 29, 30, 31 | 3syl 19 | . . . 4 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → ((𝑁 − 1) / 2) ∈ ℕ0) |
| 33 | 32 | ex 418 | . . 3 ⊢ (2 < 𝑁 → ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0)) |
| 34 | 15, 33 | jaoi 871 | . 2 ⊢ ((𝑁 = 1 ∨ 2 < 𝑁) → ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0)) |
| 35 | 1, 34 | mpcom 39 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6538 (class class class)co 7420 ℝcr 11199 0cc0 11200 1c1 11201 + caddc 11203 < clt 11343 ≤ cle 11344 − cmin 11541 / cdiv 11973 ℕcn 12335 2c2 12397 ℕ0cn0 12606 ℤcz 12693 ℤ≥cuz 12965 |
| 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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 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 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 |
| This theorem is used by: nn0ob 16554 nn0onn0ex 49634 nneom 49638 flnn0div2ge 49644 flnn0ohalf 49645 |
| Copyright terms: Public domain | W3C validator |