Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eqreznegel | Structured version Visualization version 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 3919 | . . . . . . 7 ⊢ (𝐴 ⊆ ℤ → (-𝑤 ∈ 𝐴 → -𝑤 ∈ ℤ)) | |
2 | recn 11007 | . . . . . . . 8 ⊢ (𝑤 ∈ ℝ → 𝑤 ∈ ℂ) | |
3 | negid 11314 | . . . . . . . . . . 11 ⊢ (𝑤 ∈ ℂ → (𝑤 + -𝑤) = 0) | |
4 | 0z 12376 | . . . . . . . . . . 11 ⊢ 0 ∈ ℤ | |
5 | 3, 4 | eqeltrdi 2845 | . . . . . . . . . 10 ⊢ (𝑤 ∈ ℂ → (𝑤 + -𝑤) ∈ ℤ) |
6 | 5 | pm4.71i 561 | . . . . . . . . 9 ⊢ (𝑤 ∈ ℂ ↔ (𝑤 ∈ ℂ ∧ (𝑤 + -𝑤) ∈ ℤ)) |
7 | zrevaddcl 12411 | . . . . . . . . 9 ⊢ (-𝑤 ∈ ℤ → ((𝑤 ∈ ℂ ∧ (𝑤 + -𝑤) ∈ ℤ) ↔ 𝑤 ∈ ℤ)) | |
8 | 6, 7 | bitrid 283 | . . . . . . . 8 ⊢ (-𝑤 ∈ ℤ → (𝑤 ∈ ℂ ↔ 𝑤 ∈ ℤ)) |
9 | 2, 8 | syl5ib 244 | . . . . . . 7 ⊢ (-𝑤 ∈ ℤ → (𝑤 ∈ ℝ → 𝑤 ∈ ℤ)) |
10 | 1, 9 | syl6 35 | . . . . . 6 ⊢ (𝐴 ⊆ ℤ → (-𝑤 ∈ 𝐴 → (𝑤 ∈ ℝ → 𝑤 ∈ ℤ))) |
11 | 10 | impcomd 413 | . . . . 5 ⊢ (𝐴 ⊆ ℤ → ((𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ ℤ)) |
12 | simpr 486 | . . . . 5 ⊢ ((𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴) → -𝑤 ∈ 𝐴) | |
13 | 11, 12 | jca2 515 | . . . 4 ⊢ (𝐴 ⊆ ℤ → ((𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴) → (𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴))) |
14 | zre 12369 | . . . . 5 ⊢ (𝑤 ∈ ℤ → 𝑤 ∈ ℝ) | |
15 | 14 | anim1i 616 | . . . 4 ⊢ ((𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → (𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴)) |
16 | 13, 15 | impbid1 224 | . . 3 ⊢ (𝐴 ⊆ ℤ → ((𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴) ↔ (𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴))) |
17 | negeq 11259 | . . . . 5 ⊢ (𝑧 = 𝑤 → -𝑧 = -𝑤) | |
18 | 17 | eleq1d 2821 | . . . 4 ⊢ (𝑧 = 𝑤 → (-𝑧 ∈ 𝐴 ↔ -𝑤 ∈ 𝐴)) |
19 | 18 | elrab 3629 | . . 3 ⊢ (𝑤 ∈ {𝑧 ∈ ℝ ∣ -𝑧 ∈ 𝐴} ↔ (𝑤 ∈ ℝ ∧ -𝑤 ∈ 𝐴)) |
20 | 18 | elrab 3629 | . . 3 ⊢ (𝑤 ∈ {𝑧 ∈ ℤ ∣ -𝑧 ∈ 𝐴} ↔ (𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴)) |
21 | 16, 19, 20 | 3bitr4g 314 | . 2 ⊢ (𝐴 ⊆ ℤ → (𝑤 ∈ {𝑧 ∈ ℝ ∣ -𝑧 ∈ 𝐴} ↔ 𝑤 ∈ {𝑧 ∈ ℤ ∣ -𝑧 ∈ 𝐴})) |
22 | 21 | eqrdv 2734 | 1 ⊢ (𝐴 ⊆ ℤ → {𝑧 ∈ ℝ ∣ -𝑧 ∈ 𝐴} = {𝑧 ∈ ℤ ∣ -𝑧 ∈ 𝐴}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1539 ∈ wcel 2104 {crab 3284 ⊆ wss 3892 (class class class)co 7307 ℂcc 10915 ℝcr 10916 0cc0 10917 + caddc 10920 -cneg 11252 ℤcz 12365 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-resscn 10974 ax-1cn 10975 ax-icn 10976 ax-addcl 10977 ax-addrcl 10978 ax-mulcl 10979 ax-mulrcl 10980 ax-mulcom 10981 ax-addass 10982 ax-mulass 10983 ax-distr 10984 ax-i2m1 10985 ax-1ne0 10986 ax-1rid 10987 ax-rnegex 10988 ax-rrecex 10989 ax-cnre 10990 ax-pre-lttri 10991 ax-pre-lttrn 10992 ax-pre-ltadd 10993 ax-pre-mulgt0 10994 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3286 df-rab 3287 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-tr 5199 df-id 5500 df-eprel 5506 df-po 5514 df-so 5515 df-fr 5555 df-we 5557 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-pred 6217 df-ord 6284 df-on 6285 df-lim 6286 df-suc 6287 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-riota 7264 df-ov 7310 df-oprab 7311 df-mpo 7312 df-om 7745 df-2nd 7864 df-frecs 8128 df-wrecs 8159 df-recs 8233 df-rdg 8272 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-pnf 11057 df-mnf 11058 df-xr 11059 df-ltxr 11060 df-le 11061 df-sub 11253 df-neg 11254 df-nn 12020 df-n0 12280 df-z 12366 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |