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

Theorem sbth 6981
Description: Schroeder-Bernstein Theorem. Theorem 18 of [Suppes] p. 95. This theorem states that if set 
A is smaller (has lower cardinality) than  B and vice-versa, then  A and  B are equinumerous (have the same cardinality). The interesting thing is that this can be proved without invoking the Axiom of Choice, as we do here, but the proof as you can see is quite difficult. (The theorem can be proved more easily if we allow AC.) The main proof consists of lemmas sbthlem1 6971 through sbthlem10 6980; this final piece mainly changes bound variables to eliminate the hypotheses of sbthlem10 6980. We follow closely the proof in Suppes, which you should consult to understand our proof at a higher level. Note that Suppes' proof, which is credited to J. M. Whitaker, does not require the Axiom of Infinity. (Contributed by NM, 8-Jun-1998.)
Assertion
Ref Expression
sbth  |-  ( ( A  ~<_  B  /\  B  ~<_  A )  ->  A  ~~  B )

Proof of Theorem sbth
Dummy variables  x  y  z  w  f 
g are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 reldom 6869 . . . 4  |-  Rel  ~<_
21brrelexi 4729 . . 3  |-  ( A  ~<_  B  ->  A  e.  _V )
31brrelexi 4729 . . 3  |-  ( B  ~<_  A  ->  B  e.  _V )
4 breq1 4026 . . . . . 6  |-  ( z  =  A  ->  (
z  ~<_  w  <->  A  ~<_  w ) )
5 breq2 4027 . . . . . 6  |-  ( z  =  A  ->  (
w  ~<_  z  <->  w  ~<_  A ) )
64, 5anbi12d 691 . . . . 5  |-  ( z  =  A  ->  (
( z  ~<_  w  /\  w  ~<_  z )  <->  ( A  ~<_  w  /\  w  ~<_  A ) ) )
7 breq1 4026 . . . . 5  |-  ( z  =  A  ->  (
z  ~~  w  <->  A  ~~  w ) )
86, 7imbi12d 311 . . . 4  |-  ( z  =  A  ->  (
( ( z  ~<_  w  /\  w  ~<_  z )  ->  z  ~~  w
)  <->  ( ( A  ~<_  w  /\  w  ~<_  A )  ->  A  ~~  w ) ) )
9 breq2 4027 . . . . . 6  |-  ( w  =  B  ->  ( A  ~<_  w  <->  A  ~<_  B ) )
10 breq1 4026 . . . . . 6  |-  ( w  =  B  ->  (
w  ~<_  A  <->  B  ~<_  A ) )
119, 10anbi12d 691 . . . . 5  |-  ( w  =  B  ->  (
( A  ~<_  w  /\  w  ~<_  A )  <->  ( A  ~<_  B  /\  B  ~<_  A ) ) )
12 breq2 4027 . . . . 5  |-  ( w  =  B  ->  ( A  ~~  w  <->  A  ~~  B ) )
1311, 12imbi12d 311 . . . 4  |-  ( w  =  B  ->  (
( ( A  ~<_  w  /\  w  ~<_  A )  ->  A  ~~  w
)  <->  ( ( A  ~<_  B  /\  B  ~<_  A )  ->  A  ~~  B ) ) )
14 vex 2791 . . . . 5  |-  z  e. 
_V
15 sseq1 3199 . . . . . . 7  |-  ( y  =  x  ->  (
y  C_  z  <->  x  C_  z
) )
16 imaeq2 5008 . . . . . . . . . 10  |-  ( y  =  x  ->  (
f " y )  =  ( f "
x ) )
1716difeq2d 3294 . . . . . . . . 9  |-  ( y  =  x  ->  (
w  \  ( f " y ) )  =  ( w  \ 
( f " x
) ) )
1817imaeq2d 5012 . . . . . . . 8  |-  ( y  =  x  ->  (
g " ( w 
\  ( f "
y ) ) )  =  ( g "
( w  \  (
f " x ) ) ) )
19 difeq2 3288 . . . . . . . 8  |-  ( y  =  x  ->  (
z  \  y )  =  ( z  \  x ) )
2018, 19sseq12d 3207 . . . . . . 7  |-  ( y  =  x  ->  (
( g " (
w  \  ( f " y ) ) )  C_  ( z  \  y )  <->  ( g " ( w  \ 
( f " x
) ) )  C_  ( z  \  x
) ) )
2115, 20anbi12d 691 . . . . . 6  |-  ( y  =  x  ->  (
( y  C_  z  /\  ( g " (
w  \  ( f " y ) ) )  C_  ( z  \  y ) )  <-> 
( x  C_  z  /\  ( g " (
w  \  ( f " x ) ) )  C_  ( z  \  x ) ) ) )
2221cbvabv 2402 . . . . 5  |-  { y  |  ( y  C_  z  /\  ( g "
( w  \  (
f " y ) ) )  C_  (
z  \  y )
) }  =  {
x  |  ( x 
C_  z  /\  (
g " ( w 
\  ( f "
x ) ) ) 
C_  ( z  \  x ) ) }
23 eqid 2283 . . . . 5  |-  ( ( f  |`  U. { y  |  ( y  C_  z  /\  ( g "
( w  \  (
f " y ) ) )  C_  (
z  \  y )
) } )  u.  ( `' g  |`  ( z  \  U. { y  |  ( y  C_  z  /\  ( g " (
w  \  ( f " y ) ) )  C_  ( z  \  y ) ) } ) ) )  =  ( ( f  |`  U. { y  |  ( y  C_  z  /\  ( g " (
w  \  ( f " y ) ) )  C_  ( z  \  y ) ) } )  u.  ( `' g  |`  ( z 
\  U. { y  |  ( y  C_  z  /\  ( g " (
w  \  ( f " y ) ) )  C_  ( z  \  y ) ) } ) ) )
24 vex 2791 . . . . 5  |-  w  e. 
_V
2514, 22, 23, 24sbthlem10 6980 . . . 4  |-  ( ( z  ~<_  w  /\  w  ~<_  z )  ->  z  ~~  w )
268, 13, 25vtocl2g 2847 . . 3  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( ( A  ~<_  B  /\  B  ~<_  A )  ->  A  ~~  B
) )
272, 3, 26syl2an 463 . 2  |-  ( ( A  ~<_  B  /\  B  ~<_  A )  ->  (
( A  ~<_  B  /\  B  ~<_  A )  ->  A  ~~  B ) )
2827pm2.43i 43 1  |-  ( ( A  ~<_  B  /\  B  ~<_  A )  ->  A  ~~  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1623    e. wcel 1684   {cab 2269   _Vcvv 2788    \ cdif 3149    u. cun 3150    C_ wss 3152   U.cuni 3827   class class class wbr 4023   `'ccnv 4688    |` cres 4691   "cima 4692    ~~ cen 6860    ~<_ cdom 6861
This theorem is referenced by:  sbthb  6982  sdomnsym  6986  domtriord  7007  xpen  7024  limenpsi  7036  php  7045  onomeneq  7050  unbnn  7113  infxpenlem  7641  fseqen  7654  infpwfien  7689  inffien  7690  alephdom  7708  mappwen  7739  infcdaabs  7832  infunabs  7833  infcda  7834  infdif  7835  infxpabs  7838  infmap2  7844  gchhar  8293  gchaleph  8297  inttsk  8396  inar1  8397  xpnnenOLD  12488  znnen  12491  qnnen  12492  rpnnen  12505  rexpen  12506  mreexfidimd  13552  acsinfdimd  14285  fislw  14936  opnreen  18336  ovolctb2  18851  vitali  18968  aannenlem3  19710  basellem4  20321  lgsqrlem4  20583  umgraex  23875  sndw  25100  pellexlem4  26917  pellexlem5  26918  idomsubgmo  27514
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-en 6864  df-dom 6865
  Copyright terms: Public domain W3C validator