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

Theorem brdom 7058
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 7056 . 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 1717   _Vcvv 2901   class class class wbr 4155   -1-1->wf1 5393    ~<_ cdom 7045
This theorem is referenced by:  domen  7059  domtr  7098  sbthlem10  7164  1sdom  7249  ac10ct  7850  domtriomlem  8257  2ndcdisj  17442  birthdaylem3  20661
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 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2370  ax-sep 4273  ax-nul 4281  ax-pr 4346  ax-un 4643
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 2244  df-mo 2245  df-clab 2376  df-cleq 2382  df-clel 2385  df-nfc 2514  df-ne 2554  df-ral 2656  df-rex 2657  df-rab 2660  df-v 2903  df-dif 3268  df-un 3270  df-in 3272  df-ss 3279  df-nul 3574  df-if 3685  df-sn 3765  df-pr 3766  df-op 3768  df-uni 3960  df-br 4156  df-opab 4210  df-xp 4826  df-rel 4827  df-cnv 4828  df-dm 4830  df-rn 4831  df-fn 5399  df-f 5400  df-f1 5401  df-dom 7049
  Copyright terms: Public domain W3C validator