![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eqreznegel | GIF version |
Description: Two ways to express the image under negation of a set of integers. (Contributed by Paul Chapman, 21-Mar-2011.) |
Ref | Expression |
---|---|
eqreznegel | ⊢ (𝐴 ⊆ ℤ → {𝑧 ∈ ℝ ∣ -𝑧 ∈ 𝐴} = {𝑧 ∈ ℤ ∣ -𝑧 ∈ 𝐴}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssel 3151 | . . . . . . . 8 ⊢ (𝐴 ⊆ ℤ → (-𝑤 ∈ 𝐴 → -𝑤 ∈ ℤ)) | |
2 | recn 7947 | . . . . . . . . 9 ⊢ (𝑤 ∈ ℝ → 𝑤 ∈ ℂ) | |
3 | negid 8207 | . . . . . . . . . . . 12 ⊢ (𝑤 ∈ ℂ → (𝑤 + -𝑤) = 0) | |
4 | 0z 9267 | . . . . . . . . . . . 12 ⊢ 0 ∈ ℤ | |
5 | 3, 4 | eqeltrdi 2268 | . . . . . . . . . . 11 ⊢ (𝑤 ∈ ℂ → (𝑤 + -𝑤) ∈ ℤ) |
6 | 5 | pm4.71i 391 | . . . . . . . . . 10 ⊢ (𝑤 ∈ ℂ ↔ (𝑤 ∈ ℂ ∧ (𝑤 + -𝑤) ∈ ℤ)) |
7 | zrevaddcl 9306 | . . . . . . . . . 10 ⊢ (-𝑤 ∈ ℤ → ((𝑤 ∈ ℂ ∧ (𝑤 + -𝑤) ∈ ℤ) ↔ 𝑤 ∈ ℤ)) | |
8 | 6, 7 | bitrid 192 | . . . . . . . . 9 ⊢ (-𝑤 ∈ ℤ → (𝑤 ∈ ℂ ↔ 𝑤 ∈ ℤ)) |
9 | 2, 8 | imbitrid 154 | . . . . . . . 8 ⊢ (-𝑤 ∈ ℤ → (𝑤 ∈ ℝ → 𝑤 ∈ ℤ)) |
10 | 1, 9 | syl6 33 | . . . . . . 7 ⊢ (𝐴 ⊆ ℤ → (-𝑤 ∈ 𝐴 → (𝑤 ∈ ℝ → 𝑤 ∈ ℤ))) |
11 | 10 | com23 78 | . . . . . 6 ⊢ (𝐴 ⊆ ℤ → (𝑤 ∈ ℝ → (-𝑤 ∈ 𝐴 → 𝑤 ∈ ℤ))) |
12 | 11 | impd 254 | . . . . 5 ⊢ (𝐴 ⊆ ℤ → ((𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ ℤ)) |
13 | simpr 110 | . . . . . 6 ⊢ ((𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴) → -𝑤 ∈ 𝐴) | |
14 | 13 | a1i 9 | . . . . 5 ⊢ (𝐴 ⊆ ℤ → ((𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴) → -𝑤 ∈ 𝐴)) |
15 | 12, 14 | jcad 307 | . . . 4 ⊢ (𝐴 ⊆ ℤ → ((𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴) → (𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴))) |
16 | zre 9260 | . . . . 5 ⊢ (𝑤 ∈ ℤ → 𝑤 ∈ ℝ) | |
17 | 16 | anim1i 340 | . . . 4 ⊢ ((𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → (𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴)) |
18 | 15, 17 | impbid1 142 | . . 3 ⊢ (𝐴 ⊆ ℤ → ((𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴) ↔ (𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴))) |
19 | negeq 8153 | . . . . 5 ⊢ (𝑧 = 𝑤 → -𝑧 = -𝑤) | |
20 | 19 | eleq1d 2246 | . . . 4 ⊢ (𝑧 = 𝑤 → (-𝑧 ∈ 𝐴 ↔ -𝑤 ∈ 𝐴)) |
21 | 20 | elrab 2895 | . . 3 ⊢ (𝑤 ∈ {𝑧 ∈ ℝ ∣ -𝑧 ∈ 𝐴} ↔ (𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴)) |
22 | 20 | elrab 2895 | . . 3 ⊢ (𝑤 ∈ {𝑧 ∈ ℤ ∣ -𝑧 ∈ 𝐴} ↔ (𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴)) |
23 | 18, 21, 22 | 3bitr4g 223 | . 2 ⊢ (𝐴 ⊆ ℤ → (𝑤 ∈ {𝑧 ∈ ℝ ∣ -𝑧 ∈ 𝐴} ↔ 𝑤 ∈ {𝑧 ∈ ℤ ∣ -𝑧 ∈ 𝐴})) |
24 | 23 | eqrdv 2175 | 1 ⊢ (𝐴 ⊆ ℤ → {𝑧 ∈ ℝ ∣ -𝑧 ∈ 𝐴} = {𝑧 ∈ ℤ ∣ -𝑧 ∈ 𝐴}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 {crab 2459 ⊆ wss 3131 (class class class)co 5878 ℂcc 7812 ℝcr 7813 0cc0 7814 + caddc 7817 -cneg 8132 ℤcz 9256 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7905 ax-resscn 7906 ax-1cn 7907 ax-1re 7908 ax-icn 7909 ax-addcl 7910 ax-addrcl 7911 ax-mulcl 7912 ax-addcom 7914 ax-addass 7916 ax-distr 7918 ax-i2m1 7919 ax-0lt1 7920 ax-0id 7922 ax-rnegex 7923 ax-cnre 7925 ax-pre-ltirr 7926 ax-pre-ltwlin 7927 ax-pre-lttrn 7928 ax-pre-ltadd 7930 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2741 df-sbc 2965 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-br 4006 df-opab 4067 df-id 4295 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-iota 5180 df-fun 5220 df-fv 5226 df-riota 5834 df-ov 5881 df-oprab 5882 df-mpo 5883 df-pnf 7997 df-mnf 7998 df-xr 7999 df-ltxr 8000 df-le 8001 df-sub 8133 df-neg 8134 df-inn 8923 df-n0 9180 df-z 9257 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |