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

Theorem harcard 7791
Description: The class of ordinal numbers dominated by a set is a cardinal number. Theorem 59 of [Suppes] p. 228. (Contributed by Mario Carneiro, 20-Jan-2013.) (Revised by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
harcard  |-  ( card `  (har `  A )
)  =  (har `  A )

Proof of Theorem harcard
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 harcl 7455 . 2  |-  (har `  A )  e.  On
2 harndom 7458 . . . . . . 7  |-  -.  (har `  A )  ~<_  A
3 simpll 731 . . . . . . . . 9  |-  ( ( ( x  e.  On  /\  (har `  A )  ~~  x )  /\  y  e.  (har `  A )
)  ->  x  e.  On )
4 simpr 448 . . . . . . . . . . 11  |-  ( ( ( x  e.  On  /\  (har `  A )  ~~  x )  /\  y  e.  (har `  A )
)  ->  y  e.  (har `  A ) )
5 elharval 7457 . . . . . . . . . . 11  |-  ( y  e.  (har `  A
)  <->  ( y  e.  On  /\  y  ~<_  A ) )
64, 5sylib 189 . . . . . . . . . 10  |-  ( ( ( x  e.  On  /\  (har `  A )  ~~  x )  /\  y  e.  (har `  A )
)  ->  ( y  e.  On  /\  y  ~<_  A ) )
76simpld 446 . . . . . . . . 9  |-  ( ( ( x  e.  On  /\  (har `  A )  ~~  x )  /\  y  e.  (har `  A )
)  ->  y  e.  On )
8 ontri1 4549 . . . . . . . . 9  |-  ( ( x  e.  On  /\  y  e.  On )  ->  ( x  C_  y  <->  -.  y  e.  x ) )
93, 7, 8syl2anc 643 . . . . . . . 8  |-  ( ( ( x  e.  On  /\  (har `  A )  ~~  x )  /\  y  e.  (har `  A )
)  ->  ( x  C_  y  <->  -.  y  e.  x ) )
10 simpllr 736 . . . . . . . . . 10  |-  ( ( ( ( x  e.  On  /\  (har `  A )  ~~  x
)  /\  y  e.  (har `  A ) )  /\  x  C_  y
)  ->  (har `  A
)  ~~  x )
11 vex 2895 . . . . . . . . . . . 12  |-  y  e. 
_V
12 ssdomg 7082 . . . . . . . . . . . 12  |-  ( y  e.  _V  ->  (
x  C_  y  ->  x  ~<_  y ) )
1311, 12ax-mp 8 . . . . . . . . . . 11  |-  ( x 
C_  y  ->  x  ~<_  y )
146simprd 450 . . . . . . . . . . 11  |-  ( ( ( x  e.  On  /\  (har `  A )  ~~  x )  /\  y  e.  (har `  A )
)  ->  y  ~<_  A )
15 domtr 7089 . . . . . . . . . . 11  |-  ( ( x  ~<_  y  /\  y  ~<_  A )  ->  x  ~<_  A )
1613, 14, 15syl2anr 465 . . . . . . . . . 10  |-  ( ( ( ( x  e.  On  /\  (har `  A )  ~~  x
)  /\  y  e.  (har `  A ) )  /\  x  C_  y
)  ->  x  ~<_  A )
17 endomtr 7094 . . . . . . . . . 10  |-  ( ( (har `  A )  ~~  x  /\  x  ~<_  A )  ->  (har `  A )  ~<_  A )
1810, 16, 17syl2anc 643 . . . . . . . . 9  |-  ( ( ( ( x  e.  On  /\  (har `  A )  ~~  x
)  /\  y  e.  (har `  A ) )  /\  x  C_  y
)  ->  (har `  A
)  ~<_  A )
1918ex 424 . . . . . . . 8  |-  ( ( ( x  e.  On  /\  (har `  A )  ~~  x )  /\  y  e.  (har `  A )
)  ->  ( x  C_  y  ->  (har `  A
)  ~<_  A ) )
209, 19sylbird 227 . . . . . . 7  |-  ( ( ( x  e.  On  /\  (har `  A )  ~~  x )  /\  y  e.  (har `  A )
)  ->  ( -.  y  e.  x  ->  (har
`  A )  ~<_  A ) )
212, 20mt3i 120 . . . . . 6  |-  ( ( ( x  e.  On  /\  (har `  A )  ~~  x )  /\  y  e.  (har `  A )
)  ->  y  e.  x )
2221ex 424 . . . . 5  |-  ( ( x  e.  On  /\  (har `  A )  ~~  x )  ->  (
y  e.  (har `  A )  ->  y  e.  x ) )
2322ssrdv 3290 . . . 4  |-  ( ( x  e.  On  /\  (har `  A )  ~~  x )  ->  (har `  A )  C_  x
)
2423ex 424 . . 3  |-  ( x  e.  On  ->  (
(har `  A )  ~~  x  ->  (har `  A )  C_  x
) )
2524rgen 2707 . 2  |-  A. x  e.  On  ( (har `  A )  ~~  x  ->  (har `  A )  C_  x )
26 iscard2 7789 . 2  |-  ( (
card `  (har `  A
) )  =  (har
`  A )  <->  ( (har `  A )  e.  On  /\ 
A. x  e.  On  ( (har `  A )  ~~  x  ->  (har `  A )  C_  x
) ) )
271, 25, 26mpbir2an 887 1  |-  ( card `  (har `  A )
)  =  (har `  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    /\ wa 359    = wceq 1649    e. wcel 1717   A.wral 2642   _Vcvv 2892    C_ wss 3256   class class class wbr 4146   Oncon0 4515   ` cfv 5387    ~~ cen 7035    ~<_ cdom 7036  harchar 7450   cardccrd 7748
This theorem is referenced by:  cardprclem  7792  alephcard  7877  pwcfsdom  8384  hargch  8478
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361  ax-rep 4254  ax-sep 4264  ax-nul 4272  ax-pow 4311  ax-pr 4337  ax-un 4634
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2235  df-mo 2236  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-ne 2545  df-ral 2647  df-rex 2648  df-reu 2649  df-rmo 2650  df-rab 2651  df-v 2894  df-sbc 3098  df-csb 3188  df-dif 3259  df-un 3261  df-in 3263  df-ss 3270  df-pss 3272  df-nul 3565  df-if 3676  df-pw 3737  df-sn 3756  df-pr 3757  df-tp 3758  df-op 3759  df-uni 3951  df-int 3986  df-iun 4030  df-br 4147  df-opab 4201  df-mpt 4202  df-tr 4237  df-eprel 4428  df-id 4432  df-po 4437  df-so 4438  df-fr 4475  df-se 4476  df-we 4477  df-ord 4518  df-on 4519  df-lim 4520  df-suc 4521  df-xp 4817  df-rel 4818  df-cnv 4819  df-co 4820  df-dm 4821  df-rn 4822  df-res 4823  df-ima 4824  df-iota 5351  df-fun 5389  df-fn 5390  df-f 5391  df-f1 5392  df-fo 5393  df-f1o 5394  df-fv 5395  df-isom 5396  df-riota 6478  df-recs 6562  df-er 6834  df-en 7039  df-dom 7040  df-oi 7405  df-har 7452  df-card 7752
  Copyright terms: Public domain W3C validator