MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  negn0 Structured version   Unicode version

Theorem negn0 10933
Description: The image under negation of a nonempty set of reals is nonempty. (Contributed by Paul Chapman, 21-Mar-2011.)
Assertion
Ref Expression
negn0  |-  ( ( A  C_  RR  /\  A  =/=  (/) )  ->  { z  e.  RR  |  -u z  e.  A }  =/=  (/) )
Distinct variable group:    z, A

Proof of Theorem negn0
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 n0 3641 . . 3  |-  ( A  =/=  (/)  <->  E. x  x  e.  A )
2 ssel 3345 . . . . . . 7  |-  ( A 
C_  RR  ->  ( x  e.  A  ->  x  e.  RR ) )
3 renegcl 9664 . . . . . . . . . 10  |-  ( x  e.  RR  ->  -u x  e.  RR )
4 negeq 9594 . . . . . . . . . . . 12  |-  ( z  =  -u x  ->  -u z  =  -u -u x )
54eleq1d 2504 . . . . . . . . . . 11  |-  ( z  =  -u x  ->  ( -u z  e.  A  <->  -u -u x  e.  A ) )
65elrab3 3113 . . . . . . . . . 10  |-  ( -u x  e.  RR  ->  (
-u x  e.  {
z  e.  RR  |  -u z  e.  A }  <->  -u -u x  e.  A
) )
73, 6syl 16 . . . . . . . . 9  |-  ( x  e.  RR  ->  ( -u x  e.  { z  e.  RR  |  -u z  e.  A }  <->  -u -u x  e.  A
) )
8 recn 9364 . . . . . . . . . . 11  |-  ( x  e.  RR  ->  x  e.  CC )
98negnegd 9702 . . . . . . . . . 10  |-  ( x  e.  RR  ->  -u -u x  =  x )
109eleq1d 2504 . . . . . . . . 9  |-  ( x  e.  RR  ->  ( -u -u x  e.  A  <->  x  e.  A ) )
117, 10bitrd 253 . . . . . . . 8  |-  ( x  e.  RR  ->  ( -u x  e.  { z  e.  RR  |  -u z  e.  A }  <->  x  e.  A ) )
1211biimprd 223 . . . . . . 7  |-  ( x  e.  RR  ->  (
x  e.  A  ->  -u x  e.  { z  e.  RR  |  -u z  e.  A }
) )
132, 12syli 37 . . . . . 6  |-  ( A 
C_  RR  ->  ( x  e.  A  ->  -u x  e.  { z  e.  RR  |  -u z  e.  A } ) )
14 elex2 2979 . . . . . 6  |-  ( -u x  e.  { z  e.  RR  |  -u z  e.  A }  ->  E. y 
y  e.  { z  e.  RR  |  -u z  e.  A }
)
1513, 14syl6 33 . . . . 5  |-  ( A 
C_  RR  ->  ( x  e.  A  ->  E. y 
y  e.  { z  e.  RR  |  -u z  e.  A }
) )
16 n0 3641 . . . . 5  |-  ( { z  e.  RR  |  -u z  e.  A }  =/=  (/)  <->  E. y  y  e. 
{ z  e.  RR  |  -u z  e.  A } )
1715, 16syl6ibr 227 . . . 4  |-  ( A 
C_  RR  ->  ( x  e.  A  ->  { z  e.  RR  |  -u z  e.  A }  =/=  (/) ) )
1817exlimdv 1690 . . 3  |-  ( A 
C_  RR  ->  ( E. x  x  e.  A  ->  { z  e.  RR  |  -u z  e.  A }  =/=  (/) ) )
191, 18syl5bi 217 . 2  |-  ( A 
C_  RR  ->  ( A  =/=  (/)  ->  { z  e.  RR  |  -u z  e.  A }  =/=  (/) ) )
2019imp 429 1  |-  ( ( A  C_  RR  /\  A  =/=  (/) )  ->  { z  e.  RR  |  -u z  e.  A }  =/=  (/) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1369   E.wex 1586    e. wcel 1756    =/= wne 2601   {crab 2714    C_ wss 3323   (/)c0 3632   RRcr 9273   -ucneg 9588
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2419  ax-sep 4408  ax-nul 4416  ax-pow 4465  ax-pr 4526  ax-un 6367  ax-resscn 9331  ax-1cn 9332  ax-icn 9333  ax-addcl 9334  ax-addrcl 9335  ax-mulcl 9336  ax-mulrcl 9337  ax-mulcom 9338  ax-addass 9339  ax-mulass 9340  ax-distr 9341  ax-i2m1 9342  ax-1ne0 9343  ax-1rid 9344  ax-rnegex 9345  ax-rrecex 9346  ax-cnre 9347  ax-pre-lttri 9348  ax-pre-lttrn 9349  ax-pre-ltadd 9350
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2256  df-mo 2257  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-nel 2604  df-ral 2715  df-rex 2716  df-reu 2717  df-rab 2719  df-v 2969  df-sbc 3182  df-csb 3284  df-dif 3326  df-un 3328  df-in 3330  df-ss 3337  df-nul 3633  df-if 3787  df-pw 3857  df-sn 3873  df-pr 3875  df-op 3879  df-uni 4087  df-br 4288  df-opab 4346  df-mpt 4347  df-id 4631  df-po 4636  df-so 4637  df-xp 4841  df-rel 4842  df-cnv 4843  df-co 4844  df-dm 4845  df-rn 4846  df-res 4847  df-ima 4848  df-iota 5376  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-riota 6047  df-ov 6089  df-oprab 6090  df-mpt2 6091  df-er 7093  df-en 7303  df-dom 7304  df-sdom 7305  df-pnf 9412  df-mnf 9413  df-ltxr 9415  df-sub 9589  df-neg 9590
This theorem is referenced by:  supminf  10934
  Copyright terms: Public domain W3C validator