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

Theorem cflecard 4912
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 4906 . . 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 2080 . . . . . . . . . 10 |- A (_ A
3 ssid 2080 . . . . . . . . . . . 12 |- z (_ z
4 sseq2 2083 . . . . . . . . . . . . 13 |- (w = z -> (z (_ w <-> z (_ z))
54rcla4ev 1877 . . . . . . . . . . . 12 |- ((z e. A /\ z (_ z) -> E.w e. A z (_ w)
63, 5mpan2 696 . . . . . . . . . . 11 |- (z e. A -> E.w e. A z (_ w)
76rgen 1698 . . . . . . . . . 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 3724 . . . . . . . . . . . 12 |- (y = A -> (card` y) = (card`
A))
109eqeq2d 1486 . . . . . . . . . . 11 |- (y = A -> (x = (card` y) <-> x = (card`
A)))
11 sseq1 2082 . . . . . . . . . . . 12 |- (y = A -> (y (_ A <-> A (_ A))
12 rexeq1 1787 . . . . . . . . . . . . 13 |- (y = A -> (E.w e. y z (_ w <-> E.w e. A z (_ w))
1312ralbidv 1663 . . . . . . . . . . . 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 628 . . . . . . . . . . 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 628 . . . . . . . . . 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 1863 . . . . . . . . 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 699 . . . . . . . 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 1286 . . . . . . 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 2116 . . . . . . 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 2412 . . . . . 6 |- {(card` A)} = {x | x = (card` A)}
2220, 21syl5ss 2105 . . . . 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 2554 . . . . 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 3732 . . . . 5 |- (card` A) e. V
2625intsn 2564 . . . 4 |- |^|{(card` A)} = (card` A)
2724, 26syl6ss 2107 . . 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 2095 . 2 |- (A e. On -> (cf` A) (_ (card` A))
29 0ss 2301 . . 3 |- (/) (_ (card` A)
30 cffnon 4907 . . . . . . . 8 |- cf Fn On
31 fndm 3587 . . . . . . . 8 |- (cf Fn On -> dom cf = On)
3230, 31ax-mp 7 . . . . . . 7 |- dom cf = On
3332eleq2i 1538 . . . . . 6 |- (A e. dom cf <-> A e. On)
3433negbii 187 . . . . 5 |- (-. A e. dom cf <-> -. A e. On)
35 ndmfv 3745 . . . . 5 |- (-. A e. dom cf -> (cf` A) = (/))
3634, 35sylbir 201 . . . 4 |- (-. A e. On -> (cf` A) = (/))
3736sseq1d 2088 . . 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 954   = wceq 956   e. wcel 958  E.wex 980  {cab 1463  A.wral 1645  E.wrex 1646   (_ wss 2047  (/)c0 2280  {csn 2409  |^|cint 2533  Oncon0 2948  dom cdm 3170   Fn wfn 3177  ` cfv 3182  cardccrd 4813  cfccf 4815
This theorem is referenced by:  cfle 4913
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-9 965  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-int 2534  df-br 2620  df-opab 2667  df-id 2835  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fn 3193  df-fv 3198  df-cf 4818
Copyright terms: Public domain