| 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 16320 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → (𝑁 = 1 ∨ 2 < 𝑁)) | |
| 2 | 1m1e0 12229 | . . . . . . . 8 ⊢ (1 − 1) = 0 | |
| 3 | 2 | oveq1i 7378 | . . . . . . 7 ⊢ ((1 − 1) / 2) = (0 / 2) |
| 4 | 2cn 12232 | . . . . . . . 8 ⊢ 2 ∈ ℂ | |
| 5 | 2ne0 12261 | . . . . . . . 8 ⊢ 2 ≠ 0 | |
| 6 | 4, 5 | div0i 11887 | . . . . . . 7 ⊢ (0 / 2) = 0 |
| 7 | 3, 6 | eqtri 2760 | . . . . . 6 ⊢ ((1 − 1) / 2) = 0 |
| 8 | 0nn0 12428 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 9 | 7, 8 | eqeltri 2833 | . . . . 5 ⊢ ((1 − 1) / 2) ∈ ℕ0 |
| 10 | oveq1 7375 | . . . . . . . 8 ⊢ (𝑁 = 1 → (𝑁 − 1) = (1 − 1)) | |
| 11 | 10 | oveq1d 7383 | . . . . . . 7 ⊢ (𝑁 = 1 → ((𝑁 − 1) / 2) = ((1 − 1) / 2)) |
| 12 | 11 | eleq1d 2822 | . . . . . 6 ⊢ (𝑁 = 1 → (((𝑁 − 1) / 2) ∈ ℕ0 ↔ ((1 − 1) / 2) ∈ ℕ0)) |
| 13 | 12 | adantr 480 | . . . . 5 ⊢ ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → (((𝑁 − 1) / 2) ∈ ℕ0 ↔ ((1 − 1) / 2) ∈ ℕ0)) |
| 14 | 9, 13 | mpbiri 258 | . . . 4 ⊢ ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → ((𝑁 − 1) / 2) ∈ ℕ0) |
| 15 | 14 | ex 412 | . . 3 ⊢ (𝑁 = 1 → ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0)) |
| 16 | 2z 12535 | . . . . . . . 8 ⊢ 2 ∈ ℤ | |
| 17 | 16 | a1i 11 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 2 ∈ ℤ) |
| 18 | nn0z 12524 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 19 | 18 | ad2antrl 729 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 𝑁 ∈ ℤ) |
| 20 | 2re 12231 | . . . . . . . . . 10 ⊢ 2 ∈ ℝ | |
| 21 | nn0re 12422 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 22 | ltle 11233 | . . . . . . . . . 10 ⊢ ((2 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (2 < 𝑁 → 2 ≤ 𝑁)) | |
| 23 | 20, 21, 22 | sylancr 588 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → (2 < 𝑁 → 2 ≤ 𝑁)) |
| 24 | 23 | adantr 480 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → (2 < 𝑁 → 2 ≤ 𝑁)) |
| 25 | 24 | impcom 407 | . . . . . . 7 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 2 ≤ 𝑁) |
| 26 | eluz2 12769 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 2 ≤ 𝑁)) | |
| 27 | 17, 19, 25, 26 | syl3anbrc 1345 | . . . . . 6 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → 𝑁 ∈ (ℤ≥‘2)) |
| 28 | simprr 773 | . . . . . 6 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → ((𝑁 + 1) / 2) ∈ ℕ0) | |
| 29 | 27, 28 | jca 511 | . . . . 5 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → (𝑁 ∈ (ℤ≥‘2) ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) |
| 30 | nno 16321 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘2) ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ) | |
| 31 | nnnn0 12420 | . . . . 5 ⊢ (((𝑁 − 1) / 2) ∈ ℕ → ((𝑁 − 1) / 2) ∈ ℕ0) | |
| 32 | 29, 30, 31 | 3syl 18 | . . . 4 ⊢ ((2 < 𝑁 ∧ (𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0)) → ((𝑁 − 1) / 2) ∈ ℕ0) |
| 33 | 32 | ex 412 | . . 3 ⊢ (2 < 𝑁 → ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0)) |
| 34 | 15, 33 | jaoi 858 | . 2 ⊢ ((𝑁 = 1 ∨ 2 < 𝑁) → ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0)) |
| 35 | 1, 34 | mpcom 38 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℕ0) → ((𝑁 − 1) / 2) ∈ ℕ0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 = wceq 1542 ∈ wcel 2114 class class class wbr 5100 ‘cfv 6500 (class class class)co 7368 ℝcr 11037 0cc0 11038 1c1 11039 + caddc 11041 < clt 11178 ≤ cle 11179 − cmin 11376 / cdiv 11806 ℕcn 12157 2c2 12212 ℕ0cn0 12413 ℤcz 12500 ℤ≥cuz 12763 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-n0 12414 df-z 12501 df-uz 12764 df-rp 12918 |
| This theorem is referenced by: nn0ob 16323 nn0onn0ex 48887 nneom 48891 flnn0div2ge 48897 flnn0ohalf 48898 |
| Copyright terms: Public domain | W3C validator |