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

Theorem alephnbtwn 8504
Description: No cardinal can be sandwiched between an aleph and its successor aleph. Theorem 67 of [Suppes] p. 229. (Contributed by NM, 10-Nov-2003.) (Revised by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
alephnbtwn  |-  ( (
card `  B )  =  B  ->  -.  (
( aleph `  A )  e.  B  /\  B  e.  ( aleph `  suc  A ) ) )

Proof of Theorem alephnbtwn
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 alephon 8502 . . . . . . . 8  |-  ( aleph `  A )  e.  On
2 id 23 . . . . . . . . . 10  |-  ( (
card `  B )  =  B  ->  ( card `  B )  =  B )
3 cardon 8381 . . . . . . . . . 10  |-  ( card `  B )  e.  On
42, 3syl6eqelr 2520 . . . . . . . . 9  |-  ( (
card `  B )  =  B  ->  B  e.  On )
5 onenon 8386 . . . . . . . . 9  |-  ( B  e.  On  ->  B  e.  dom  card )
64, 5syl 17 . . . . . . . 8  |-  ( (
card `  B )  =  B  ->  B  e. 
dom  card )
7 cardsdomel 8411 . . . . . . . 8  |-  ( ( ( aleph `  A )  e.  On  /\  B  e. 
dom  card )  ->  (
( aleph `  A )  ~<  B  <->  ( aleph `  A
)  e.  ( card `  B ) ) )
81, 6, 7sylancr 668 . . . . . . 7  |-  ( (
card `  B )  =  B  ->  ( (
aleph `  A )  ~<  B 
<->  ( aleph `  A )  e.  ( card `  B
) ) )
9 eleq2 2496 . . . . . . 7  |-  ( (
card `  B )  =  B  ->  ( (
aleph `  A )  e.  ( card `  B
)  <->  ( aleph `  A
)  e.  B ) )
108, 9bitrd 257 . . . . . 6  |-  ( (
card `  B )  =  B  ->  ( (
aleph `  A )  ~<  B 
<->  ( aleph `  A )  e.  B ) )
1110adantl 468 . . . . 5  |-  ( ( A  e.  On  /\  ( card `  B )  =  B )  ->  (
( aleph `  A )  ~<  B  <->  ( aleph `  A
)  e.  B ) )
12 alephsuc 8501 . . . . . . . . . . 11  |-  ( A  e.  On  ->  ( aleph `  suc  A )  =  (har `  ( aleph `  A ) ) )
13 onenon 8386 . . . . . . . . . . . 12  |-  ( (
aleph `  A )  e.  On  ->  ( aleph `  A )  e.  dom  card )
14 harval2 8434 . . . . . . . . . . . 12  |-  ( (
aleph `  A )  e. 
dom  card  ->  (har `  ( aleph `  A ) )  =  |^| { x  e.  On  |  ( aleph `  A )  ~<  x } )
151, 13, 14mp2b 10 . . . . . . . . . . 11  |-  (har `  ( aleph `  A )
)  =  |^| { x  e.  On  |  ( aleph `  A )  ~<  x }
1612, 15syl6eq 2480 . . . . . . . . . 10  |-  ( A  e.  On  ->  ( aleph `  suc  A )  =  |^| { x  e.  On  |  ( aleph `  A )  ~<  x } )
1716eleq2d 2493 . . . . . . . . 9  |-  ( A  e.  On  ->  ( B  e.  ( aleph ` 
suc  A )  <->  B  e.  |^|
{ x  e.  On  |  ( aleph `  A
)  ~<  x } ) )
1817biimpd 211 . . . . . . . 8  |-  ( A  e.  On  ->  ( B  e.  ( aleph ` 
suc  A )  ->  B  e.  |^| { x  e.  On  |  ( aleph `  A )  ~<  x } ) )
19 breq2 4425 . . . . . . . . 9  |-  ( x  =  B  ->  (
( aleph `  A )  ~<  x  <->  ( aleph `  A
)  ~<  B ) )
2019onnminsb 6643 . . . . . . . 8  |-  ( B  e.  On  ->  ( B  e.  |^| { x  e.  On  |  ( aleph `  A )  ~<  x }  ->  -.  ( aleph `  A )  ~<  B ) )
2118, 20sylan9 662 . . . . . . 7  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( B  e.  (
aleph `  suc  A )  ->  -.  ( aleph `  A )  ~<  B ) )
2221con2d 119 . . . . . 6  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( ( aleph `  A
)  ~<  B  ->  -.  B  e.  ( aleph ` 
suc  A ) ) )
234, 22sylan2 477 . . . . 5  |-  ( ( A  e.  On  /\  ( card `  B )  =  B )  ->  (
( aleph `  A )  ~<  B  ->  -.  B  e.  ( aleph `  suc  A ) ) )
2411, 23sylbird 239 . . . 4  |-  ( ( A  e.  On  /\  ( card `  B )  =  B )  ->  (
( aleph `  A )  e.  B  ->  -.  B  e.  ( aleph `  suc  A ) ) )
25 imnan 424 . . . 4  |-  ( ( ( aleph `  A )  e.  B  ->  -.  B  e.  ( aleph `  suc  A ) )  <->  -.  ( ( aleph `  A )  e.  B  /\  B  e.  ( aleph `  suc  A ) ) )
2624, 25sylib 200 . . 3  |-  ( ( A  e.  On  /\  ( card `  B )  =  B )  ->  -.  ( ( aleph `  A
)  e.  B  /\  B  e.  ( aleph ` 
suc  A ) ) )
2726ex 436 . 2  |-  ( A  e.  On  ->  (
( card `  B )  =  B  ->  -.  (
( aleph `  A )  e.  B  /\  B  e.  ( aleph `  suc  A ) ) ) )
28 n0i 3767 . . . . . . 7  |-  ( B  e.  ( aleph `  suc  A )  ->  -.  ( aleph `  suc  A )  =  (/) )
29 alephfnon 8498 . . . . . . . . . 10  |-  aleph  Fn  On
30 fndm 5691 . . . . . . . . . 10  |-  ( aleph  Fn  On  ->  dom  aleph  =  On )
3129, 30ax-mp 5 . . . . . . . . 9  |-  dom  aleph  =  On
3231eleq2i 2501 . . . . . . . 8  |-  ( suc 
A  e.  dom  aleph  <->  suc  A  e.  On )
33 ndmfv 5903 . . . . . . . 8  |-  ( -. 
suc  A  e.  dom  aleph  ->  ( aleph `  suc  A )  =  (/) )
3432, 33sylnbir 309 . . . . . . 7  |-  ( -. 
suc  A  e.  On  ->  ( aleph `  suc  A )  =  (/) )
3528, 34nsyl2 131 . . . . . 6  |-  ( B  e.  ( aleph `  suc  A )  ->  suc  A  e.  On )
36 sucelon 6656 . . . . . 6  |-  ( A  e.  On  <->  suc  A  e.  On )
3735, 36sylibr 216 . . . . 5  |-  ( B  e.  ( aleph `  suc  A )  ->  A  e.  On )
3837adantl 468 . . . 4  |-  ( ( ( aleph `  A )  e.  B  /\  B  e.  ( aleph `  suc  A ) )  ->  A  e.  On )
3938con3i 141 . . 3  |-  ( -.  A  e.  On  ->  -.  ( ( aleph `  A
)  e.  B  /\  B  e.  ( aleph ` 
suc  A ) ) )
4039a1d 27 . 2  |-  ( -.  A  e.  On  ->  ( ( card `  B
)  =  B  ->  -.  ( ( aleph `  A
)  e.  B  /\  B  e.  ( aleph ` 
suc  A ) ) ) )
4127, 40pm2.61i 168 1  |-  ( (
card `  B )  =  B  ->  -.  (
( aleph `  A )  e.  B  /\  B  e.  ( aleph `  suc  A ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 188    /\ wa 371    = wceq 1438    e. wcel 1869   {crab 2780   (/)c0 3762   |^|cint 4253   class class class wbr 4421   dom cdm 4851   Oncon0 5440   suc csuc 5442    Fn wfn 5594   ` cfv 5599    ~< csdm 7574  harchar 8075   cardccrd 8372   alephcale 8373
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1666  ax-4 1679  ax-5 1749  ax-6 1795  ax-7 1840  ax-8 1871  ax-9 1873  ax-10 1888  ax-11 1893  ax-12 1906  ax-13 2054  ax-ext 2401  ax-rep 4534  ax-sep 4544  ax-nul 4553  ax-pow 4600  ax-pr 4658  ax-un 6595  ax-inf2 8150
This theorem depends on definitions:  df-bi 189  df-or 372  df-an 373  df-3or 984  df-3an 985  df-tru 1441  df-ex 1661  df-nf 1665  df-sb 1788  df-eu 2270  df-mo 2271  df-clab 2409  df-cleq 2415  df-clel 2418  df-nfc 2573  df-ne 2621  df-ral 2781  df-rex 2782  df-reu 2783  df-rmo 2784  df-rab 2785  df-v 3084  df-sbc 3301  df-csb 3397  df-dif 3440  df-un 3442  df-in 3444  df-ss 3451  df-pss 3453  df-nul 3763  df-if 3911  df-pw 3982  df-sn 3998  df-pr 4000  df-tp 4002  df-op 4004  df-uni 4218  df-int 4254  df-iun 4299  df-br 4422  df-opab 4481  df-mpt 4482  df-tr 4517  df-eprel 4762  df-id 4766  df-po 4772  df-so 4773  df-fr 4810  df-se 4811  df-we 4812  df-xp 4857  df-rel 4858  df-cnv 4859  df-co 4860  df-dm 4861  df-rn 4862  df-res 4863  df-ima 4864  df-pred 5397  df-ord 5443  df-on 5444  df-lim 5445  df-suc 5446  df-iota 5563  df-fun 5601  df-fn 5602  df-f 5603  df-f1 5604  df-fo 5605  df-f1o 5606  df-fv 5607  df-isom 5608  df-riota 6265  df-om 6705  df-wrecs 7034  df-recs 7096  df-rdg 7134  df-er 7369  df-en 7576  df-dom 7577  df-sdom 7578  df-oi 8029  df-har 8077  df-card 8376  df-aleph 8377
This theorem is referenced by:  alephnbtwn2  8505
  Copyright terms: Public domain W3C validator