| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nnoddm1d2 | GIF version | ||
| Description: A positive integer is odd iff its successor divided by 2 is a positive integer. (Contributed by AV, 28-Jun-2021.) |
| Ref | Expression |
|---|---|
| nnoddm1d2 | ⊢ (𝑁 ∈ ℕ → (¬ 2 ∥ 𝑁 ↔ ((𝑁 + 1) / 2) ∈ ℕ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnz 9404 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
| 2 | oddp1d2 12251 | . . 3 ⊢ (𝑁 ∈ ℤ → (¬ 2 ∥ 𝑁 ↔ ((𝑁 + 1) / 2) ∈ ℤ)) | |
| 3 | 1, 2 | syl 14 | . 2 ⊢ (𝑁 ∈ ℕ → (¬ 2 ∥ 𝑁 ↔ ((𝑁 + 1) / 2) ∈ ℤ)) |
| 4 | peano2nn 9061 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
| 5 | 4 | nnred 9062 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℝ) |
| 6 | 2re 9119 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 7 | 6 | a1i 9 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → 2 ∈ ℝ) |
| 8 | nnre 9056 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
| 9 | 1red 8100 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℝ) | |
| 10 | nngt0 9074 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 0 < 𝑁) | |
| 11 | 0lt1 8212 | . . . . . . . . . 10 ⊢ 0 < 1 | |
| 12 | 11 | a1i 9 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 0 < 1) |
| 13 | 8, 9, 10, 12 | addgt0d 8607 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → 0 < (𝑁 + 1)) |
| 14 | 2pos 9140 | . . . . . . . . 9 ⊢ 0 < 2 | |
| 15 | 14 | a1i 9 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → 0 < 2) |
| 16 | 5, 7, 13, 15 | divgt0d 9021 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 0 < ((𝑁 + 1) / 2)) |
| 17 | 16 | anim1i 340 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ ((𝑁 + 1) / 2) ∈ ℤ) → (0 < ((𝑁 + 1) / 2) ∧ ((𝑁 + 1) / 2) ∈ ℤ)) |
| 18 | 17 | ancomd 267 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ ((𝑁 + 1) / 2) ∈ ℤ) → (((𝑁 + 1) / 2) ∈ ℤ ∧ 0 < ((𝑁 + 1) / 2))) |
| 19 | elnnz 9395 | . . . . 5 ⊢ (((𝑁 + 1) / 2) ∈ ℕ ↔ (((𝑁 + 1) / 2) ∈ ℤ ∧ 0 < ((𝑁 + 1) / 2))) | |
| 20 | 18, 19 | sylibr 134 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ ((𝑁 + 1) / 2) ∈ ℤ) → ((𝑁 + 1) / 2) ∈ ℕ) |
| 21 | 20 | ex 115 | . . 3 ⊢ (𝑁 ∈ ℕ → (((𝑁 + 1) / 2) ∈ ℤ → ((𝑁 + 1) / 2) ∈ ℕ)) |
| 22 | nnz 9404 | . . 3 ⊢ (((𝑁 + 1) / 2) ∈ ℕ → ((𝑁 + 1) / 2) ∈ ℤ) | |
| 23 | 21, 22 | impbid1 142 | . 2 ⊢ (𝑁 ∈ ℕ → (((𝑁 + 1) / 2) ∈ ℤ ↔ ((𝑁 + 1) / 2) ∈ ℕ)) |
| 24 | 3, 23 | bitrd 188 | 1 ⊢ (𝑁 ∈ ℕ → (¬ 2 ∥ 𝑁 ↔ ((𝑁 + 1) / 2) ∈ ℕ)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2177 class class class wbr 4048 (class class class)co 5954 ℝcr 7937 0cc0 7938 1c1 7939 + caddc 7941 < clt 8120 / cdiv 8758 ℕcn 9049 2c2 9100 ℤcz 9385 ∥ cdvds 12148 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4167 ax-pow 4223 ax-pr 4258 ax-un 4485 ax-setind 4590 ax-cnex 8029 ax-resscn 8030 ax-1cn 8031 ax-1re 8032 ax-icn 8033 ax-addcl 8034 ax-addrcl 8035 ax-mulcl 8036 ax-mulrcl 8037 ax-addcom 8038 ax-mulcom 8039 ax-addass 8040 ax-mulass 8041 ax-distr 8042 ax-i2m1 8043 ax-0lt1 8044 ax-1rid 8045 ax-0id 8046 ax-rnegex 8047 ax-precex 8048 ax-cnre 8049 ax-pre-ltirr 8050 ax-pre-ltwlin 8051 ax-pre-lttrn 8052 ax-pre-apti 8053 ax-pre-ltadd 8054 ax-pre-mulgt0 8055 ax-pre-mulext 8056 |
| This theorem depends on definitions: df-bi 117 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-xor 1396 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3001 df-dif 3170 df-un 3172 df-in 3174 df-ss 3181 df-pw 3620 df-sn 3641 df-pr 3642 df-op 3644 df-uni 3854 df-int 3889 df-br 4049 df-opab 4111 df-id 4345 df-po 4348 df-iso 4349 df-xp 4686 df-rel 4687 df-cnv 4688 df-co 4689 df-dm 4690 df-iota 5238 df-fun 5279 df-fv 5285 df-riota 5909 df-ov 5957 df-oprab 5958 df-mpo 5959 df-pnf 8122 df-mnf 8123 df-xr 8124 df-ltxr 8125 df-le 8126 df-sub 8258 df-neg 8259 df-reap 8661 df-ap 8668 df-div 8759 df-inn 9050 df-2 9108 df-n0 9309 df-z 9386 df-dvds 12149 |
| This theorem is referenced by: gausslemma2dlem0b 15577 |
| Copyright terms: Public domain | W3C validator |