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

Theorem domen 7968
Description: Dominance in terms of equinumerosity. Example 1 of [Enderton] p. 146. (Contributed by NM, 15-Jun-1998.)
Hypothesis
Ref Expression
bren.1  |-  B  e. 
_V
Assertion
Ref Expression
domen  |-  ( A  ~<_  B  <->  E. x ( A 
~~  x  /\  x  C_  B ) )
Distinct variable groups:    x, A    x, B

Proof of Theorem domen
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 bren.1 . . 3  |-  B  e. 
_V
21brdom 7967 . 2  |-  ( A  ~<_  B  <->  E. f  f : A -1-1-> B )
3 vex 3203 . . . . . 6  |-  f  e. 
_V
43f11o 7128 . . . . 5  |-  ( f : A -1-1-> B  <->  E. x
( f : A -1-1-onto-> x  /\  x  C_  B ) )
54exbii 1774 . . . 4  |-  ( E. f  f : A -1-1-> B  <->  E. f E. x ( f : A -1-1-onto-> x  /\  x  C_  B ) )
6 excom 2042 . . . 4  |-  ( E. f E. x ( f : A -1-1-onto-> x  /\  x  C_  B )  <->  E. x E. f ( f : A -1-1-onto-> x  /\  x  C_  B ) )
75, 6bitri 264 . . 3  |-  ( E. f  f : A -1-1-> B  <->  E. x E. f ( f : A -1-1-onto-> x  /\  x  C_  B ) )
8 bren 7964 . . . . . 6  |-  ( A 
~~  x  <->  E. f 
f : A -1-1-onto-> x )
98anbi1i 731 . . . . 5  |-  ( ( A  ~~  x  /\  x  C_  B )  <->  ( E. f  f : A -1-1-onto-> x  /\  x  C_  B ) )
10 19.41v 1914 . . . . 5  |-  ( E. f ( f : A -1-1-onto-> x  /\  x  C_  B )  <->  ( E. f  f : A -1-1-onto-> x  /\  x  C_  B ) )
119, 10bitr4i 267 . . . 4  |-  ( ( A  ~~  x  /\  x  C_  B )  <->  E. f
( f : A -1-1-onto-> x  /\  x  C_  B ) )
1211exbii 1774 . . 3  |-  ( E. x ( A  ~~  x  /\  x  C_  B
)  <->  E. x E. f
( f : A -1-1-onto-> x  /\  x  C_  B ) )
137, 12bitr4i 267 . 2  |-  ( E. f  f : A -1-1-> B  <->  E. x ( A  ~~  x  /\  x  C_  B
) )
142, 13bitri 264 1  |-  ( A  ~<_  B  <->  E. x ( A 
~~  x  /\  x  C_  B ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    /\ wa 384   E.wex 1704    e. wcel 1990   _Vcvv 3200    C_ wss 3574   class class class wbr 4653   -1-1->wf1 5885   -1-1-onto->wf1o 5887    ~~ cen 7952    ~<_ cdom 7953
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-cnv 5122  df-dm 5124  df-rn 5125  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-en 7956  df-dom 7957
This theorem is referenced by:  domeng  7969  infcntss  8234  cdainf  9014  ramub2  15718  ram0  15726
  Copyright terms: Public domain W3C validator