ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eqreznegel Unicode version

Theorem eqreznegel 9848
Description: Two ways to express the image under negation of a set of integers. (Contributed by Paul Chapman, 21-Mar-2011.)
Assertion
Ref Expression
eqreznegel  |-  ( A 
C_  ZZ  ->  { z  e.  RR  |  -u z  e.  A }  =  { z  e.  ZZ  |  -u z  e.  A } )
Distinct variable group:    z, A

Proof of Theorem eqreznegel
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 ssel 3221 . . . . . . . 8  |-  ( A 
C_  ZZ  ->  ( -u w  e.  A  ->  -u w  e.  ZZ )
)
2 recn 8165 . . . . . . . . 9  |-  ( w  e.  RR  ->  w  e.  CC )
3 negid 8426 . . . . . . . . . . . 12  |-  ( w  e.  CC  ->  (
w  +  -u w
)  =  0 )
4 0z 9490 . . . . . . . . . . . 12  |-  0  e.  ZZ
53, 4eqeltrdi 2322 . . . . . . . . . . 11  |-  ( w  e.  CC  ->  (
w  +  -u w
)  e.  ZZ )
65pm4.71i 391 . . . . . . . . . 10  |-  ( w  e.  CC  <->  ( w  e.  CC  /\  ( w  +  -u w )  e.  ZZ ) )
7 zrevaddcl 9530 . . . . . . . . . 10  |-  ( -u w  e.  ZZ  ->  ( ( w  e.  CC  /\  ( w  +  -u w )  e.  ZZ ) 
<->  w  e.  ZZ ) )
86, 7bitrid 192 . . . . . . . . 9  |-  ( -u w  e.  ZZ  ->  ( w  e.  CC  <->  w  e.  ZZ ) )
92, 8imbitrid 154 . . . . . . . 8  |-  ( -u w  e.  ZZ  ->  ( w  e.  RR  ->  w  e.  ZZ ) )
101, 9syl6 33 . . . . . . 7  |-  ( A 
C_  ZZ  ->  ( -u w  e.  A  ->  ( w  e.  RR  ->  w  e.  ZZ ) ) )
1110com23 78 . . . . . 6  |-  ( A 
C_  ZZ  ->  ( w  e.  RR  ->  ( -u w  e.  A  ->  w  e.  ZZ )
) )
1211impd 254 . . . . 5  |-  ( A 
C_  ZZ  ->  ( ( w  e.  RR  /\  -u w  e.  A )  ->  w  e.  ZZ ) )
13 simpr 110 . . . . . 6  |-  ( ( w  e.  RR  /\  -u w  e.  A )  ->  -u w  e.  A
)
1413a1i 9 . . . . 5  |-  ( A 
C_  ZZ  ->  ( ( w  e.  RR  /\  -u w  e.  A )  ->  -u w  e.  A
) )
1512, 14jcad 307 . . . 4  |-  ( A 
C_  ZZ  ->  ( ( w  e.  RR  /\  -u w  e.  A )  ->  ( w  e.  ZZ  /\  -u w  e.  A ) ) )
16 zre 9483 . . . . 5  |-  ( w  e.  ZZ  ->  w  e.  RR )
1716anim1i 340 . . . 4  |-  ( ( w  e.  ZZ  /\  -u w  e.  A )  ->  ( w  e.  RR  /\  -u w  e.  A ) )
1815, 17impbid1 142 . . 3  |-  ( A 
C_  ZZ  ->  ( ( w  e.  RR  /\  -u w  e.  A )  <-> 
( w  e.  ZZ  /\  -u w  e.  A
) ) )
19 negeq 8372 . . . . 5  |-  ( z  =  w  ->  -u z  =  -u w )
2019eleq1d 2300 . . . 4  |-  ( z  =  w  ->  ( -u z  e.  A  <->  -u w  e.  A ) )
2120elrab 2962 . . 3  |-  ( w  e.  { z  e.  RR  |  -u z  e.  A }  <->  ( w  e.  RR  /\  -u w  e.  A ) )
2220elrab 2962 . . 3  |-  ( w  e.  { z  e.  ZZ  |  -u z  e.  A }  <->  ( w  e.  ZZ  /\  -u w  e.  A ) )
2318, 21, 223bitr4g 223 . 2  |-  ( A 
C_  ZZ  ->  ( w  e.  { z  e.  RR  |  -u z  e.  A }  <->  w  e.  { z  e.  ZZ  |  -u z  e.  A }
) )
2423eqrdv 2229 1  |-  ( A 
C_  ZZ  ->  { z  e.  RR  |  -u z  e.  A }  =  { z  e.  ZZ  |  -u z  e.  A } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   {crab 2514    C_ wss 3200  (class class class)co 6018   CCcc 8030   RRcr 8031   0cc0 8032    + caddc 8035   -ucneg 8351   ZZcz 9479
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-inn 9144  df-n0 9403  df-z 9480
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator