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

Theorem 0sdom 7650
Description: A set strictly dominates the empty set iff it is not empty. (Contributed by NM, 29-Jul-2004.)
Hypothesis
Ref Expression
0sdom.1  |-  A  e. 
_V
Assertion
Ref Expression
0sdom  |-  ( (/)  ~<  A 
<->  A  =/=  (/) )

Proof of Theorem 0sdom
StepHypRef Expression
1 0sdom.1 . 2  |-  A  e. 
_V
2 0sdomg 7648 . 2  |-  ( A  e.  _V  ->  ( (/) 
~<  A  <->  A  =/=  (/) ) )
31, 2ax-mp 5 1  |-  ( (/)  ~<  A 
<->  A  =/=  (/) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    e. wcel 1804    =/= wne 2638   _Vcvv 3095   (/)c0 3770   class class class wbr 4437    ~< csdm 7517
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1605  ax-4 1618  ax-5 1691  ax-6 1734  ax-7 1776  ax-8 1806  ax-9 1808  ax-10 1823  ax-11 1828  ax-12 1840  ax-13 1985  ax-ext 2421  ax-sep 4558  ax-nul 4566  ax-pow 4615  ax-pr 4676  ax-un 6577
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 976  df-tru 1386  df-ex 1600  df-nf 1604  df-sb 1727  df-eu 2272  df-mo 2273  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2593  df-ne 2640  df-ral 2798  df-rex 2799  df-rab 2802  df-v 3097  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-nul 3771  df-if 3927  df-pw 3999  df-sn 4015  df-pr 4017  df-op 4021  df-uni 4235  df-br 4438  df-opab 4496  df-id 4785  df-xp 4995  df-rel 4996  df-cnv 4997  df-co 4998  df-dm 4999  df-rn 5000  df-res 5001  df-ima 5002  df-fun 5580  df-fn 5581  df-f 5582  df-f1 5583  df-fo 5584  df-f1o 5585  df-er 7313  df-en 7519  df-dom 7520  df-sdom 7521
This theorem is referenced by:  sdom1  7721  marypha1lem  7895  konigthlem  8946  pwcfsdom  8961  cfpwsdom  8962  rankcf  9158  r1tskina  9163  1stcfb  19924  snct  27512
  Copyright terms: Public domain W3C validator