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

Theorem cflecard 4924
Description: Cofinality is bounded by the cardinality of its argument.
Assertion
Ref Expression
cflecard |- (cf` A) (_ (card` A)

Proof of Theorem cflecard
StepHypRef Expression
1 cfval 4918 . . 3 |- (A e. On -> (cf` A) = |^|{x | E.y(x = (card`
y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))})
2 ssid 2083 . . . . . . . . . 10 |- A (_ A
3 ssid 2083 . . . . . . . . . . . 12 |- z (_ z
4 sseq2 2086 . . . . . . . . . . . . 13 |- (w = z -> (z (_ w <-> z (_ z))
54rcla4ev 1880 . . . . . . . . . . . 12 |- ((z e. A /\ z (_ z) -> E.w e. A z (_ w)
63, 5mpan2 698 . . . . . . . . . . 11 |- (z e. A -> E.w e. A z (_ w)
76rgen 1701 . . . . . . . . . 10 |- A.z e. A E.w e. A z (_ w
82, 7pm3.2i 285 . . . . . . . . 9 |- (A (_ A /\ A.z e. A E.w e. A z (_ w)
9 fveq2 3730 . . . . . . . . . . . 12 |- (y = A -> (card` y) = (card`
A))
109eqeq2d 1489 . . . . . . . . . . 11 |- (y = A -> (x = (card` y) <-> x = (card`
A)))
11 sseq1 2085 . . . . . . . . . . . 12 |- (y = A -> (y (_ A <-> A (_ A))
12 rexeq1 1790 . . . . . . . . . . . . 13 |- (y = A -> (E.w e. y z (_ w <-> E.w e. A z (_ w))
1312ralbidv 1666 . . . . . . . . . . . 12 |- (y = A -> (A.z e. A E.w e. y z (_ w <-> A.z e. A E.w e. A z (_ w))
1411, 13anbi12d 630 . . . . . . . . . . 11 |- (y = A -> ((y (_ A /\ A.z e. A E.w e. y z (_ w) <-> (A (_ A /\ A.z e. A E.w e. A z (_ w)))
1510, 14anbi12d 630 . . . . . . . . . 10 |- (y = A -> ((x = (card` y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w)) <-> (x = (card`
A) /\ (A (_ A /\ A.z e. A E.w e. A z (_ w))))
1615cla4egv 1866 . . . . . . . . 9 |- (A e. On -> ((x = (card` A) /\ (A (_ A /\ A.z e. A E.w e. A z (_ w)) -> E.y(x = (card` y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))))
178, 16mpan2i 701 . . . . . . . 8 |- (A e. On -> (x = (card` A) -> E.y(x = (card`
y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))))
181719.21aiv 1288 . . . . . . 7 |- (A e. On -> A.x(x = (card` A) -> E.y(x = (card` y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))))
19 ss2ab 2119 . . . . . . 7 |- ({x | x = (card` A)} (_ {x | E.y(x = (card` y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))} <-> A.x(x = (card` A) -> E.y(x = (card` y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))))
2018, 19sylibr 200 . . . . . 6 |- (A e. On -> {x | x = (card` A)} (_ {x | E.y(x = (card`
y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))})
21 df-sn 2416 . . . . . 6 |- {(card` A)} = {x | x = (card` A)}
2220, 21syl5ss 2108 . . . . 5 |- (A e. On -> {(card` A)} (_ {x | E.y(x = (card`
y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))})
23 intss 2558 . . . . 5 |- ({(card` A)} (_ {x | E.y(x = (card` y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))} -> |^|{x | E.y(x = (card`
y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))} (_ |^|{(card` A)})
2422, 23syl 10 . . . 4 |- (A e. On -> |^|{x | E.y(x = (card` y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))} (_ |^|{(card`
A)})
25 fvex 3738 . . . . 5 |- (card` A) e. V
2625intsn 2568 . . . 4 |- |^|{(card` A)} = (card` A)
2724, 26syl6ss 2110 . . 3 |- (A e. On -> |^|{x | E.y(x = (card` y) /\ (y (_ A /\ A.z e. A E.w e. y z (_ w))} (_ (card` A))
281, 27eqsstrd 2098 . 2 |- (A e. On -> (cf` A) (_ (card` A))
29 0ss 2305 . . 3 |- (/) (_ (card` A)
30 cffnon 4919 . . . . . . . 8 |- cf Fn On
31 fndm 3593 . . . . . . . 8 |- (cf Fn On -> dom cf = On)
3230, 31ax-mp 7 . . . . . . 7 |- dom cf = On
3332eleq2i 1541 . . . . . 6 |- (A e. dom cf <-> A e. On)
3433negbii 187 . . . . 5 |- (-. A e. dom cf <-> -. A e. On)
35 ndmfv 3751 . . . . 5 |- (-. A e. dom cf -> (cf` A) = (/))
3634, 35sylbir 201 . . . 4 |- (-. A e. On -> (cf` A) = (/))
3736sseq1d 2091 . . 3 |- (-. A e. On -> ((cf` A) (_ (card` A) <-> (/) (_ (card` A)))
3829, 37mpbiri 194 . 2 |- (-. A e. On -> (cf` A) (_ (card` A))
3928, 38pm2.61i 126 1 |- (cf` A) (_ (card` A)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   /\ wa 223  A.wal 956   = wceq 958   e. wcel 960  E.wex 982  {cab 1466  A.wral 1648  E.wrex 1649   (_ wss 2050  (/)c0 2283  {csn 2413  |^|cint 2537  Oncon0 2954  dom cdm 3176   Fn wfn 3183  ` cfv 3188  cardccrd 4823  cfccf 4825
This theorem is referenced by:  cfle 4925
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-int 2538  df-br 2625  df-opab 2672  df-id 2841  df-xp 3190  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fun 3198  df-fn 3199  df-fv 3204  df-cf 4828
Copyright terms: Public domain