| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nn0oddm1d2 | GIF version | ||
| Description: A positive integer is odd iff its predecessor divided by 2 is a positive integer. (Contributed by AV, 28-Jun-2021.) |
| Ref | Expression |
|---|---|
| nn0oddm1d2 | ⊢ (𝑁 ∈ ℕ0 → (¬ 2 ∥ 𝑁 ↔ ((𝑁 − 1) / 2) ∈ ℕ0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0z 9499 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 2 | oddp1d2 12456 | . . 3 ⊢ (𝑁 ∈ ℤ → (¬ 2 ∥ 𝑁 ↔ ((𝑁 + 1) / 2) ∈ ℤ)) | |
| 3 | 1, 2 | syl 14 | . 2 ⊢ (𝑁 ∈ ℕ0 → (¬ 2 ∥ 𝑁 ↔ ((𝑁 + 1) / 2) ∈ ℤ)) |
| 4 | nn0re 9411 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ) | |
| 5 | 1red 8194 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℝ) | |
| 6 | nn0ge0 9427 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 0 ≤ 𝑁) | |
| 7 | 0le1 8661 | . . . . . . . . . 10 ⊢ 0 ≤ 1 | |
| 8 | 7 | a1i 9 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 0 ≤ 1) |
| 9 | 4, 5, 6, 8 | addge0d 8702 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 0 ≤ (𝑁 + 1)) |
| 10 | peano2nn0 9442 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
| 11 | 10 | nn0red 9456 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℝ) |
| 12 | 2re 9213 | . . . . . . . . . 10 ⊢ 2 ∈ ℝ | |
| 13 | 12 | a1i 9 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ) |
| 14 | 2pos 9234 | . . . . . . . . . 10 ⊢ 0 < 2 | |
| 15 | 14 | a1i 9 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 0 < 2) |
| 16 | ge0div 9051 | . . . . . . . . 9 ⊢ (((𝑁 + 1) ∈ ℝ ∧ 2 ∈ ℝ ∧ 0 < 2) → (0 ≤ (𝑁 + 1) ↔ 0 ≤ ((𝑁 + 1) / 2))) | |
| 17 | 11, 13, 15, 16 | syl3anc 1273 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (0 ≤ (𝑁 + 1) ↔ 0 ≤ ((𝑁 + 1) / 2))) |
| 18 | 9, 17 | mpbid 147 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 0 ≤ ((𝑁 + 1) / 2)) |
| 19 | 18 | anim1i 340 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℤ) → (0 ≤ ((𝑁 + 1) / 2) ∧ ((𝑁 + 1) / 2) ∈ ℤ)) |
| 20 | 19 | ancomd 267 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℤ) → (((𝑁 + 1) / 2) ∈ ℤ ∧ 0 ≤ ((𝑁 + 1) / 2))) |
| 21 | elnn0z 9492 | . . . . 5 ⊢ (((𝑁 + 1) / 2) ∈ ℕ0 ↔ (((𝑁 + 1) / 2) ∈ ℤ ∧ 0 ≤ ((𝑁 + 1) / 2))) | |
| 22 | 20, 21 | sylibr 134 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑁 + 1) / 2) ∈ ℤ) → ((𝑁 + 1) / 2) ∈ ℕ0) |
| 23 | 22 | ex 115 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (((𝑁 + 1) / 2) ∈ ℤ → ((𝑁 + 1) / 2) ∈ ℕ0)) |
| 24 | nn0z 9499 | . . 3 ⊢ (((𝑁 + 1) / 2) ∈ ℕ0 → ((𝑁 + 1) / 2) ∈ ℤ) | |
| 25 | 23, 24 | impbid1 142 | . 2 ⊢ (𝑁 ∈ ℕ0 → (((𝑁 + 1) / 2) ∈ ℤ ↔ ((𝑁 + 1) / 2) ∈ ℕ0)) |
| 26 | nn0ob 12474 | . 2 ⊢ (𝑁 ∈ ℕ0 → (((𝑁 + 1) / 2) ∈ ℕ0 ↔ ((𝑁 − 1) / 2) ∈ ℕ0)) | |
| 27 | 3, 25, 26 | 3bitrd 214 | 1 ⊢ (𝑁 ∈ ℕ0 → (¬ 2 ∥ 𝑁 ↔ ((𝑁 − 1) / 2) ∈ ℕ0)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2202 class class class wbr 4088 (class class class)co 6018 ℝcr 8031 0cc0 8032 1c1 8033 + caddc 8035 < clt 8214 ≤ cle 8215 − cmin 8350 / cdiv 8852 2c2 9194 ℕ0cn0 9402 ℤcz 9479 ∥ cdvds 12353 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-xor 1420 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-po 4393 df-iso 4394 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-n0 9403 df-z 9480 df-uz 9756 df-dvds 12354 |
| This theorem is referenced by: lgsval 15739 lgsfvalg 15740 gausslemma2dlem6 15802 |
| Copyright terms: Public domain | W3C validator |