HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem cardalephex 3691
Description: Every transfinite cardinal is an aleph and vice-versa. Theorem 8A(b) of [Enderton] p. 213 and its converse.
Assertion
Ref Expression
cardalephex |- (om (_ A -> ((card` A) = A <-> E.x e. On A = (aleph` x)))
Distinct variable group(s):   x,A

Proof of Theorem cardalephex
StepHypRef Expression
1 fveq2 2832 . . . . . 6 |- (x = |^|{y e. On | A (_ (aleph` y)} -> (aleph` x) = (aleph` |^|{y e. On | A (_ (aleph` y)}))
21cleq2d 1112 . . . . 5 |- (x = |^|{y e. On | A (_ (aleph` y)} -> (A = (aleph` x) <-> A = (aleph` |^|{y e. On | A (_ (aleph` y)})))
32rcla4ev 1403 . . . 4 |- ((|^|{y e. On | A (_ (aleph` y)} e. On /\ A = (aleph` |^|{y e. On | A (_ (aleph` y)})) -> E.x e. On A = (aleph` x))
4 pm3.26 256 . . . . 5 |- ((om (_ A /\ (card` A) = A) -> om (_ A)
5 cardaleph 3690 . . . . . . 7 |- ((om (_ A /\ (card` A) = A) -> A = (aleph` |^|{y e. On | A (_ (aleph` y)}))
65sseq2d 1528 . . . . . 6 |- ((om (_ A /\ (card` A) = A) -> (om (_ A <-> om (_ (aleph` |^|{y e. On | A (_ (aleph` y)})))
7 alephgeom 3687 . . . . . 6 |- (|^|{y e. On | A (_ (aleph` y)} e. On <-> om (_ (aleph` |^|{y e. On | A (_ (aleph` y)}))
86, 7syl6bbr 416 . . . . 5 |- ((om (_ A /\ (card` A) = A) -> (om (_ A <-> |^|{y e. On | A (_ (aleph` y)} e. On))
94, 8mpbid 170 . . . 4 |- ((om (_ A /\ (card` A) = A) -> |^|{y e. On | A (_ (aleph` y)} e. On)
103, 9, 5sylanc 361 . . 3 |- ((om (_ A /\ (card` A) = A) -> E.x e. On A = (aleph` x))
1110exp 291 . 2 |- (om (_ A -> ((card` A) = A -> E.x e. On A = (aleph` x)))
12 alephcard 3673 . . . . . 6 |- (card` (aleph` x)) = (aleph` x)
13 fveq2 2832 . . . . . . 7 |- (A = (aleph` x) -> (card` A) = (card` (aleph` x)))
14 id 9 . . . . . . 7 |- (A = (aleph` x) -> A = (aleph` x))
1513, 14cleq12d 1115 . . . . . 6 |- (A = (aleph` x) -> ((card` A) = A <-> (card`
(aleph` x)) = (aleph` x)))
1612, 15mpbiri 169 . . . . 5 |- (A = (aleph` x) -> (card` A) = A)
1716a1i 7 . . . 4 |- (x e. On -> (A = (aleph` x) -> (card` A) = A))
1817r19.23aiv 1284 . . 3 |- (E.x e. On A = (aleph` x) -> (card` A) = A)
1918a1i 7 . 2 |- (om (_ A -> (E.x e. On A = (aleph` x) -> (card` A) = A))
2011, 19impbid 397 1 |- (om (_ A -> ((card` A) = A <-> E.x e. On A = (aleph` x)))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127   /\ wa 196   = wceq 1091   e. wcel 1092  E.wrex 1202  {crab 1204   (_ wss 1487  |^|cint 1965  Oncon0 2199  omcom 2372  ` cfv 2422  cardccrd 3620  alephcale 3621
This theorem is referenced by:  isinfcard 3692
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077  ax-reg 1078  ax-inf 1079  ax-ac 1080
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ne 1192  df-ral 1205  df-rex 1206  df-reu 1207  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-pss 1494  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-int 1966  df-iun 1996  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-om 2373  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fo 2436  df-f1o 2437  df-fv 2438  df-rdg 2970  df-er 3200  df-en 3274  df-dom 3275  df-sdom 3276  df-card 3623  df-aleph 3624
metamath.org