| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > even2n | GIF version | ||
| Description: An integer is even iff it is twice another integer. (Contributed by AV, 25-Jun-2020.) |
| Ref | Expression |
|---|---|
| even2n | ⊢ (2 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (2 · 𝑛) = 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | evenelz 12660 | . 2 ⊢ (2 ∥ 𝑁 → 𝑁 ∈ ℤ) | |
| 2 | 2z 9684 | . . . . . . 7 ⊢ 2 ∈ ℤ | |
| 3 | 2 | a1i 9 | . . . . . 6 ⊢ (𝑛 ∈ ℤ → 2 ∈ ℤ) |
| 4 | id 19 | . . . . . 6 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℤ) | |
| 5 | 3, 4 | zmulcld 9786 | . . . . 5 ⊢ (𝑛 ∈ ℤ → (2 · 𝑛) ∈ ℤ) |
| 6 | 5 | adantr 276 | . . . 4 ⊢ ((𝑛 ∈ ℤ ∧ (2 · 𝑛) = 𝑁) → (2 · 𝑛) ∈ ℤ) |
| 7 | eleq1 2301 | . . . . 5 ⊢ ((2 · 𝑛) = 𝑁 → ((2 · 𝑛) ∈ ℤ ↔ 𝑁 ∈ ℤ)) | |
| 8 | 7 | adantl 277 | . . . 4 ⊢ ((𝑛 ∈ ℤ ∧ (2 · 𝑛) = 𝑁) → ((2 · 𝑛) ∈ ℤ ↔ 𝑁 ∈ ℤ)) |
| 9 | 6, 8 | mpbid 147 | . . 3 ⊢ ((𝑛 ∈ ℤ ∧ (2 · 𝑛) = 𝑁) → 𝑁 ∈ ℤ) |
| 10 | 9 | rexlimiva 2663 | . 2 ⊢ (∃𝑛 ∈ ℤ (2 · 𝑛) = 𝑁 → 𝑁 ∈ ℤ) |
| 11 | divides 12582 | . . . 4 ⊢ ((2 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (2 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 2) = 𝑁)) | |
| 12 | zcn 9661 | . . . . . . 7 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℂ) | |
| 13 | 2cnd 9387 | . . . . . . 7 ⊢ (𝑛 ∈ ℤ → 2 ∈ ℂ) | |
| 14 | 12, 13 | mulcomd 8354 | . . . . . 6 ⊢ (𝑛 ∈ ℤ → (𝑛 · 2) = (2 · 𝑛)) |
| 15 | 14 | eqeq1d 2247 | . . . . 5 ⊢ (𝑛 ∈ ℤ → ((𝑛 · 2) = 𝑁 ↔ (2 · 𝑛) = 𝑁)) |
| 16 | 15 | rexbiia 2565 | . . . 4 ⊢ (∃𝑛 ∈ ℤ (𝑛 · 2) = 𝑁 ↔ ∃𝑛 ∈ ℤ (2 · 𝑛) = 𝑁) |
| 17 | 11, 16 | bitrdi 196 | . . 3 ⊢ ((2 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (2 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (2 · 𝑛) = 𝑁)) |
| 18 | 2, 17 | mpan 428 | . 2 ⊢ (𝑁 ∈ ℤ → (2 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (2 · 𝑛) = 𝑁)) |
| 19 | 1, 10, 18 | pm5.21nii 716 | 1 ⊢ (2 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (2 · 𝑛) = 𝑁) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 class class class wbr 4131 (class class class)co 6088 · cmul 8191 2c2 9365 ℤcz 9656 ∥ cdvds 12580 |
| This proof depends on 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 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-mulrcl 8285 ax-addcom 8286 ax-mulcom 8287 ax-addass 8288 ax-mulass 8289 ax-distr 8290 ax-i2m1 8291 ax-0lt1 8292 ax-1rid 8293 ax-0id 8294 ax-rnegex 8295 ax-cnre 8297 ax-pre-ltirr 8298 ax-pre-ltwlin 8299 ax-pre-lttrn 8300 ax-pre-ltadd 8302 |
| This proof 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-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-iota 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8369 df-mnf 8370 df-xr 8371 df-ltxr 8372 df-le 8373 df-sub 8507 df-neg 8508 df-inn 9315 df-2 9373 df-n0 9576 df-z 9657 df-dvds 12581 |
| This theorem is used by: evennn02n 12675 evennn2n 12676 m1expe 12692 |
| Copyright terms: Public domain | W3C validator |