ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  domen Unicode version

Theorem domen 6917
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 6916 . 2  |-  ( A  ~<_  B  <->  E. f  f : A -1-1-> B )
3 vex 2803 . . . . . 6  |-  f  e. 
_V
43f11o 5613 . . . . 5  |-  ( f : A -1-1-> B  <->  E. x
( f : A -1-1-onto-> x  /\  x  C_  B ) )
54exbii 1651 . . . 4  |-  ( E. f  f : A -1-1-> B  <->  E. f E. x ( f : A -1-1-onto-> x  /\  x  C_  B ) )
6 excom 1710 . . . 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 184 . . 3  |-  ( E. f  f : A -1-1-> B  <->  E. x E. f ( f : A -1-1-onto-> x  /\  x  C_  B ) )
8 bren 6912 . . . . . 6  |-  ( A 
~~  x  <->  E. f 
f : A -1-1-onto-> x )
98anbi1i 458 . . . . 5  |-  ( ( A  ~~  x  /\  x  C_  B )  <->  ( E. f  f : A -1-1-onto-> x  /\  x  C_  B ) )
10 19.41v 1949 . . . . 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 187 . . . 4  |-  ( ( A  ~~  x  /\  x  C_  B )  <->  E. f
( f : A -1-1-onto-> x  /\  x  C_  B ) )
1211exbii 1651 . . 3  |-  ( E. x ( A  ~~  x  /\  x  C_  B
)  <->  E. x E. f
( f : A -1-1-onto-> x  /\  x  C_  B ) )
137, 12bitr4i 187 . 2  |-  ( E. f  f : A -1-1-> B  <->  E. x ( A  ~~  x  /\  x  C_  B
) )
142, 13bitri 184 1  |-  ( A  ~<_  B  <->  E. x ( A 
~~  x  /\  x  C_  B ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105   E.wex 1538    e. wcel 2200   _Vcvv 2800    C_ wss 3198   class class class wbr 4086   -1-1->wf1 5321   -1-1-onto->wf1o 5323    ~~ cen 6902    ~<_ cdom 6903
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-xp 4729  df-rel 4730  df-cnv 4731  df-dm 4733  df-rn 4734  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-en 6905  df-dom 6906
This theorem is referenced by:  domeng  6918  php5dom  7044
  Copyright terms: Public domain W3C validator