| 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 16439 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → (𝑁 = 1 ∨ 2 < 𝑁)) | |
| 2 | 1m1e0 12313 | . . . . . . . 8 ⊢ (1 − 1) = 0 | |
| 3 | 2 | oveq1i 7421 | . . . . . . 7 ⊢ ((1 − 1) / 2) = (0 / 2) |
| 4 | 2cn 12316 | . . . . . . . 8 ⊢ 2 ∈ ℂ | |
| 5 | 2ne0 12347 | . . . . . . . 8 ⊢ 2 ≠ 0 | |
| 6 | 4, 5 | div0i 11949 | . . . . . . 7 ⊢ (0 / 2) = 0 |
| 7 | 3, 6 | eqtri 2792 | . . . . . 6 ⊢ ((1 − 1) / 2) = 0 |
| 8 | 0nn0 12519 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 9 | 7, 8 | eqeltri 2865 | . . . . 5 ⊢ ((1 − 1) / 2) ∈ ℕ0 |
| 10 | oveq1 7418 | . . . . . . . 8 ⊢ (𝑁 = 1 → (𝑁 − 1) = (1 − 1)) | |
| 11 | 10 | oveq1d 7426 | . . . . . . 7 ⊢ (𝑁 = 1 → ((𝑁 − 1) / 2) = ((1 − 1) / 2)) |
| 12 | 11 | eleq1d 2854 | . . . . . 6 ⊢ (𝑁 = 1 → (((𝑁 − 1) / 2) ∈ ℕ0 ↔ ((1 − 1) / 2) ∈ ℕ0)) |
| 13 | 12 | adantr 485 | . . . . 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 417 | . . 3 ⊢ (𝑁 = 1 → ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0)) |
| 16 | 2z 12626 | . . . . . . . 8 ⊢ 2 ∈ ℤ | |
| 17 | 16 | a1i 11 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 2 ∈ ℤ) |
| 18 | nn0z 12615 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 19 | 18 | ad2antrl 740 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 𝑁 ∈ ℤ) |
| 20 | 2re 12315 | . . . . . . . . . 10 ⊢ 2 ∈ ℝ | |
| 21 | nn0re 12513 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 22 | ltle 11298 | . . . . . . . . . 10 ⊢ ((2 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (2 < 𝑁 → 2 ≤ 𝑁)) | |
| 23 | 20, 21, 22 | sylancr 598 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → (2 < 𝑁 → 2 ≤ 𝑁)) |
| 24 | 23 | adantr 485 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → (2 < 𝑁 → 2 ≤ 𝑁)) |
| 25 | 24 | impcom 412 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 2 ≤ 𝑁) |
| 26 | eluz2 12868 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 2 ≤ 𝑁)) | |
| 27 | 17, 19, 25, 26 | syl3anbrc 1360 | . . . . . 6 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 𝑁 ∈ (ℤ≥‘2)) |
| 28 | simprr 784 | . . . . . 6 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → ((𝑁 + 1) / 2) ∈ ℕ0) | |
| 29 | 27, 28 | jca 520 | . . . . 5 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → (𝑁 ∈ (ℤ≥‘2) ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) |
| 30 | nno 16440 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘2) ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ) | |
| 31 | nnnn0 12511 | . . . . 5 ⊢ (((𝑁 − 1) / 2) ∈ ℕ → ((𝑁 − 1) / 2) ∈ ℕ0) | |
| 32 | 29, 30, 31 | 3syl 19 | . . . 4 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → ((𝑁 − 1) / 2) ∈ ℕ0) |
| 33 | 32 | ex 417 | . . 3 ⊢ (2 < 𝑁 → ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0)) |
| 34 | 15, 33 | jaoi 870 | . 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 |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1567 ∈ wcel 2149 class class class wbr 5113 ‘cfv 6537 (class class class)co 7411 ℝcr 11099 0cc0 11100 1c1 11101 + caddc 11103 < clt 11243 ≤ cle 11244 − cmin 11441 / cdiv 11871 ℕcn 12233 2c2 12295 ℕ0cn0 12504 ℤcz 12591 ℤ≥cuz 12862 |
| 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 5261 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-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 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-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-n0 12505 df-z 12592 df-uz 12863 df-rp 13017 |
| This theorem is referenced by: nn0ob 16442 nn0onn0ex 49222 nneom 49226 flnn0div2ge 49232 flnn0ohalf 49233 |
| Copyright terms: Public domain | W3C validator |