| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > evennn2n | GIF version | ||
| Description: A positive integer is even iff it is twice another positive integer. (Contributed by AV, 12-Aug-2021.) |
| Ref | Expression |
|---|---|
| evennn2n | ⊢ (𝑁 ∈ ℕ → (2 ∥ 𝑁 ↔ ∃𝑛 ∈ ℕ (2 · 𝑛) = 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2301 | . . . . . . . 8 ⊢ ((2 · 𝑛) = 𝑁 → ((2 · 𝑛) ∈ ℕ ↔ 𝑁 ∈ ℕ)) | |
| 2 | simpr 110 | . . . . . . . . . 10 ⊢ (((2 · 𝑛) ∈ ℕ ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℤ) | |
| 3 | 2re 9353 | . . . . . . . . . . . 12 ⊢ 2 ∈ ℝ | |
| 4 | 3 | a1i 9 | . . . . . . . . . . 11 ⊢ (((2 · 𝑛) ∈ ℕ ∧ 𝑛 ∈ ℤ) → 2 ∈ ℝ) |
| 5 | zre 9627 | . . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℝ) | |
| 6 | 5 | adantl 277 | . . . . . . . . . . 11 ⊢ (((2 · 𝑛) ∈ ℕ ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℝ) |
| 7 | 0le2 9373 | . . . . . . . . . . . 12 ⊢ 0 ≤ 2 | |
| 8 | 7 | a1i 9 | . . . . . . . . . . 11 ⊢ (((2 · 𝑛) ∈ ℕ ∧ 𝑛 ∈ ℤ) → 0 ≤ 2) |
| 9 | nngt0 9308 | . . . . . . . . . . . 12 ⊢ ((2 · 𝑛) ∈ ℕ → 0 < (2 · 𝑛)) | |
| 10 | 9 | adantr 276 | . . . . . . . . . . 11 ⊢ (((2 · 𝑛) ∈ ℕ ∧ 𝑛 ∈ ℤ) → 0 < (2 · 𝑛)) |
| 11 | prodgt0 9172 | . . . . . . . . . . 11 ⊢ (((2 ∈ ℝ ∧ 𝑛 ∈ ℝ) ∧ (0 ≤ 2 ∧ 0 < (2 · 𝑛))) → 0 < 𝑛) | |
| 12 | 4, 6, 8, 10, 11 | syl22anc 1279 | . . . . . . . . . 10 ⊢ (((2 · 𝑛) ∈ ℕ ∧ 𝑛 ∈ ℤ) → 0 < 𝑛) |
| 13 | elnnz 9633 | . . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ ↔ (𝑛 ∈ ℤ ∧ 0 < 𝑛)) | |
| 14 | 2, 12, 13 | sylanbrc 421 | . . . . . . . . 9 ⊢ (((2 · 𝑛) ∈ ℕ ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℕ) |
| 15 | 14 | ex 115 | . . . . . . . 8 ⊢ ((2 · 𝑛) ∈ ℕ → (𝑛 ∈ ℤ → 𝑛 ∈ ℕ)) |
| 16 | 1, 15 | biimtrrdi 164 | . . . . . . 7 ⊢ ((2 · 𝑛) = 𝑁 → (𝑁 ∈ ℕ → (𝑛 ∈ ℤ → 𝑛 ∈ ℕ))) |
| 17 | 16 | com13 80 | . . . . . 6 ⊢ (𝑛 ∈ ℤ → (𝑁 ∈ ℕ → ((2 · 𝑛) = 𝑁 → 𝑛 ∈ ℕ))) |
| 18 | 17 | impcom 125 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℤ) → ((2 · 𝑛) = 𝑁 → 𝑛 ∈ ℕ)) |
| 19 | 18 | pm4.71rd 398 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℤ) → ((2 · 𝑛) = 𝑁 ↔ (𝑛 ∈ ℕ ∧ (2 · 𝑛) = 𝑁))) |
| 20 | 19 | bicomd 141 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℤ) → ((𝑛 ∈ ℕ ∧ (2 · 𝑛) = 𝑁) ↔ (2 · 𝑛) = 𝑁)) |
| 21 | 20 | rexbidva 2547 | . 2 ⊢ (𝑁 ∈ ℕ → (∃𝑛 ∈ ℤ (𝑛 ∈ ℕ ∧ (2 · 𝑛) = 𝑁) ↔ ∃𝑛 ∈ ℤ (2 · 𝑛) = 𝑁)) |
| 22 | nnssz 9640 | . . 3 ⊢ ℕ ⊆ ℤ | |
| 23 | rexss 3315 | . . 3 ⊢ (ℕ ⊆ ℤ → (∃𝑛 ∈ ℕ (2 · 𝑛) = 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 ∈ ℕ ∧ (2 · 𝑛) = 𝑁))) | |
| 24 | 22, 23 | mp1i 10 | . 2 ⊢ (𝑁 ∈ ℕ → (∃𝑛 ∈ ℕ (2 · 𝑛) = 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 ∈ ℕ ∧ (2 · 𝑛) = 𝑁))) |
| 25 | even2n 12619 | . . 3 ⊢ (2 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (2 · 𝑛) = 𝑁) | |
| 26 | 25 | a1i 9 | . 2 ⊢ (𝑁 ∈ ℕ → (2 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (2 · 𝑛) = 𝑁)) |
| 27 | 21, 24, 26 | 3bitr4rd 221 | 1 ⊢ (𝑁 ∈ ℕ → (2 ∥ 𝑁 ↔ ∃𝑛 ∈ ℕ (2 · 𝑛) = 𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 ⊆ wss 3220 class class class wbr 4125 (class class class)co 6075 ℝcr 8168 0cc0 8169 · cmul 8174 < clt 8350 ≤ cle 8351 ℕcn 9283 2c2 9334 ℤcz 9623 ∥ cdvds 12532 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-mulrcl 8268 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-precex 8279 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 ax-pre-mulgt0 8286 ax-pre-mulext 8287 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-br 4126 df-opab 4188 df-id 4433 df-po 4436 df-iso 4437 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-iota 5332 df-fun 5374 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-reap 8893 df-ap 8900 df-div 8993 df-inn 9284 df-2 9342 df-n0 9543 df-z 9624 df-dvds 12533 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |