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

Theorem negm 9848
Description: The image under negation of an inhabited set of reals is inhabited. (Contributed by Jim Kingdon, 10-Apr-2020.)
Assertion
Ref Expression
negm  |-  ( ( A  C_  RR  /\  E. x  x  e.  A
)  ->  E. y 
y  e.  { z  e.  RR  |  -u z  e.  A }
)
Distinct variable group:    x, A, y, z

Proof of Theorem negm
StepHypRef Expression
1 ssel 3221 . . . . 5  |-  ( A 
C_  RR  ->  ( x  e.  A  ->  x  e.  RR ) )
2 renegcl 8439 . . . . . . . 8  |-  ( x  e.  RR  ->  -u x  e.  RR )
3 negeq 8371 . . . . . . . . . 10  |-  ( z  =  -u x  ->  -u z  =  -u -u x )
43eleq1d 2300 . . . . . . . . 9  |-  ( z  =  -u x  ->  ( -u z  e.  A  <->  -u -u x  e.  A ) )
54elrab3 2963 . . . . . . . 8  |-  ( -u x  e.  RR  ->  (
-u x  e.  {
z  e.  RR  |  -u z  e.  A }  <->  -u -u x  e.  A
) )
62, 5syl 14 . . . . . . 7  |-  ( x  e.  RR  ->  ( -u x  e.  { z  e.  RR  |  -u z  e.  A }  <->  -u -u x  e.  A
) )
7 recn 8164 . . . . . . . . 9  |-  ( x  e.  RR  ->  x  e.  CC )
87negnegd 8480 . . . . . . . 8  |-  ( x  e.  RR  ->  -u -u x  =  x )
98eleq1d 2300 . . . . . . 7  |-  ( x  e.  RR  ->  ( -u -u x  e.  A  <->  x  e.  A ) )
106, 9bitrd 188 . . . . . 6  |-  ( x  e.  RR  ->  ( -u x  e.  { z  e.  RR  |  -u z  e.  A }  <->  x  e.  A ) )
1110biimprd 158 . . . . 5  |-  ( x  e.  RR  ->  (
x  e.  A  ->  -u x  e.  { z  e.  RR  |  -u z  e.  A }
) )
121, 11syli 37 . . . 4  |-  ( A 
C_  RR  ->  ( x  e.  A  ->  -u x  e.  { z  e.  RR  |  -u z  e.  A } ) )
13 elex2 2819 . . . 4  |-  ( -u x  e.  { z  e.  RR  |  -u z  e.  A }  ->  E. y 
y  e.  { z  e.  RR  |  -u z  e.  A }
)
1412, 13syl6 33 . . 3  |-  ( A 
C_  RR  ->  ( x  e.  A  ->  E. y 
y  e.  { z  e.  RR  |  -u z  e.  A }
) )
1514exlimdv 1867 . 2  |-  ( A 
C_  RR  ->  ( E. x  x  e.  A  ->  E. y  y  e. 
{ z  e.  RR  |  -u z  e.  A } ) )
1615imp 124 1  |-  ( ( A  C_  RR  /\  E. x  x  e.  A
)  ->  E. y 
y  e.  { z  e.  RR  |  -u z  e.  A }
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397   E.wex 1540    e. wcel 2202   {crab 2514    C_ wss 3200   RRcr 8030   -ucneg 8350
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-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-setind 4635  ax-resscn 8123  ax-1cn 8124  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142
This theorem depends on definitions:  df-bi 117  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-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-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 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-sub 8351  df-neg 8352
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator