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

Theorem brdom 7087
Description: Dominance relation. (Contributed by NM, 15-Jun-1998.)
Hypothesis
Ref Expression
bren.1  |-  B  e. 
_V
Assertion
Ref Expression
brdom  |-  ( A  ~<_  B  <->  E. f  f : A -1-1-> B )
Distinct variable groups:    A, f    B, f

Proof of Theorem brdom
StepHypRef Expression
1 bren.1 . 2  |-  B  e. 
_V
2 brdomg 7085 . 2  |-  ( B  e.  _V  ->  ( A  ~<_  B  <->  E. f 
f : A -1-1-> B
) )
31, 2ax-mp 8 1  |-  ( A  ~<_  B  <->  E. f  f : A -1-1-> B )
Colors of variables: wff set class
Syntax hints:    <-> wb 177   E.wex 1547    e. wcel 1721   _Vcvv 2924   class class class wbr 4180   -1-1->wf1 5418    ~<_ cdom 7074
This theorem is referenced by:  domen  7088  domtr  7127  sbthlem10  7193  1sdom  7278  ac10ct  7879  domtriomlem  8286  2ndcdisj  17480  birthdaylem3  20753
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2393  ax-sep 4298  ax-nul 4306  ax-pr 4371  ax-un 4668
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2266  df-mo 2267  df-clab 2399  df-cleq 2405  df-clel 2408  df-nfc 2537  df-ne 2577  df-ral 2679  df-rex 2680  df-rab 2683  df-v 2926  df-dif 3291  df-un 3293  df-in 3295  df-ss 3302  df-nul 3597  df-if 3708  df-sn 3788  df-pr 3789  df-op 3791  df-uni 3984  df-br 4181  df-opab 4235  df-xp 4851  df-rel 4852  df-cnv 4853  df-dm 4855  df-rn 4856  df-fn 5424  df-f 5425  df-f1 5426  df-dom 7078
  Copyright terms: Public domain W3C validator