| 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 16474 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → (𝑁 = 1 ∨ 2 < 𝑁)) | |
| 2 | 1m1e0 12340 | . . . . . . . 8 ⊢ (1 − 1) = 0 | |
| 3 | 2 | oveq1i 7424 | . . . . . . 7 ⊢ ((1 − 1) / 2) = (0 / 2) |
| 4 | 2cn 12343 | . . . . . . . 8 ⊢ 2 ∈ ℂ | |
| 5 | 2ne0 12374 | . . . . . . . 8 ⊢ 2 ≠ 0 | |
| 6 | 4, 5 | div0i 11976 | . . . . . . 7 ⊢ (0 / 2) = 0 |
| 7 | 3, 6 | eqtri 2783 | . . . . . 6 ⊢ ((1 − 1) / 2) = 0 |
| 8 | 0nn0 12546 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 9 | 7, 8 | eqeltri 2856 | . . . . 5 ⊢ ((1 − 1) / 2) ∈ ℕ0 |
| 10 | oveq1 7421 | . . . . . . . 8 ⊢ (𝑁 = 1 → (𝑁 − 1) = (1 − 1)) | |
| 11 | 10 | oveq1d 7429 | . . . . . . 7 ⊢ (𝑁 = 1 → ((𝑁 − 1) / 2) = ((1 − 1) / 2)) |
| 12 | 11 | eleq1d 2845 | . . . . . 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 12653 | . . . . . . . 8 ⊢ 2 ∈ ℤ | |
| 17 | 16 | a1i 11 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 2 ∈ ℤ) |
| 18 | nn0z 12642 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 19 | 18 | ad2antrl 741 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 𝑁 ∈ ℤ) |
| 20 | 2re 12342 | . . . . . . . . . 10 ⊢ 2 ∈ ℝ | |
| 21 | nn0re 12540 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 22 | ltle 11325 | . . . . . . . . . 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 12896 | . . . . . . 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 16475 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘2) ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ) | |
| 31 | nnnn0 12538 | . . . . 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 6533 (class class class)co 7414 ℝcr 11126 0cc0 11127 1c1 11128 + caddc 11130 < clt 11270 ≤ cle 11271 − cmin 11468 / cdiv 11898 ℕcn 12260 2c2 12322 ℕ0cn0 12531 ℤcz 12618 ℤ≥cuz 12890 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 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-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-n0 12532 df-z 12619 df-uz 12891 df-rp 13046 |
| This theorem is used by: nn0ob 16477 nn0onn0ex 49456 nneom 49460 flnn0div2ge 49466 flnn0ohalf 49467 |
| Copyright terms: Public domain | W3C validator |