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

Theorem negm 9910
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 3222 . . . . 5  |-  ( A 
C_  RR  ->  ( x  e.  A  ->  x  e.  RR ) )
2 renegcl 8499 . . . . . . . 8  |-  ( x  e.  RR  ->  -u x  e.  RR )
3 negeq 8431 . . . . . . . . . 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 2964 . . . . . . . 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 8225 . . . . . . . . 9  |-  ( x  e.  RR  ->  x  e.  CC )
87negnegd 8540 . . . . . . . 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 2820 . . . 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 1398   E.wex 1541    e. wcel 2202   {crab 2515    C_ wss 3201   RRcr 8091   -ucneg 8410
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-setind 4641  ax-resscn 8184  ax-1cn 8185  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-distr 8196  ax-i2m1 8197  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-sub 8411  df-neg 8412
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator