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

Theorem brdom 6876
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 6874 . 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 176   E.wex 1530    e. wcel 1686   _Vcvv 2790   class class class wbr 4025   -1-1->wf1 5254    ~<_ cdom 6863
This theorem is referenced by:  domen  6877  domtr  6916  sbthlem10  6982  1sdom  7067  ac10ct  7663  domtriomlem  8070  2ndcdisj  17184  birthdaylem3  20250
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1637  ax-8 1645  ax-13 1688  ax-14 1690  ax-6 1705  ax-7 1710  ax-11 1717  ax-12 1868  ax-ext 2266  ax-sep 4143  ax-nul 4151  ax-pr 4216  ax-un 4514
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1531  df-nf 1534  df-sb 1632  df-eu 2149  df-mo 2150  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-ne 2450  df-ral 2550  df-rex 2551  df-rab 2554  df-v 2792  df-dif 3157  df-un 3159  df-in 3161  df-ss 3168  df-nul 3458  df-if 3568  df-sn 3648  df-pr 3649  df-op 3651  df-uni 3830  df-br 4026  df-opab 4080  df-xp 4697  df-rel 4698  df-cnv 4699  df-dm 4701  df-rn 4702  df-fn 5260  df-f 5261  df-f1 5262  df-dom 6867
  Copyright terms: Public domain W3C validator