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

Theorem cflecard 3707
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 3701 . . 3 (A ∈ On → (cf ‘A) = {x∣∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))})
2 ssid 1519 . . . . . . . . . 10 AA
3 ssid 1519 . . . . . . . . . . . 12 zz
4 sseq2 1522 . . . . . . . . . . . . 13 (w = z → (zwzz))
54rcla4ev 1403 . . . . . . . . . . . 12 ((zAzz) → ∃wA zw)
63, 5mpan2 519 . . . . . . . . . . 11 (zA → ∃wA zw)
76rgen 1247 . . . . . . . . . 10 zAwA zw
82, 7pm3.2i 234 . . . . . . . . 9 (AA ∧ ∀zAwA zw)
9 fveq2 2832 . . . . . . . . . . . 12 (y = A → (card ‘y) = (card ‘A))
109cleq2d 1112 . . . . . . . . . . 11 (y = A → (x = (card ‘y) ↔ x = (card ‘A)))
11 sseq1 1521 . . . . . . . . . . . 12 (y = A → (yAAA))
12 rexeq 1325 . . . . . . . . . . . . 13 (y = A → (∃wy zw ↔ ∃wA zw))
1312biraldv 1219 . . . . . . . . . . . 12 (y = A → (∀zAwy zw ↔ ∀zAwA zw))
1411, 13anbi12d 476 . . . . . . . . . . 11 (y = A → ((yA ∧ ∀zAwy zw) ↔ (AA ∧ ∀zAwA zw)))
1510, 14anbi12d 476 . . . . . . . . . 10 (y = A → ((x = (card ‘y) ∧ (yA ∧ ∀zAwy zw)) ↔ (x = (card ‘A) ∧ (AA ∧ ∀zAwA zw))))
1615cla4egv 1397 . . . . . . . . 9 (A ∈ On → ((x = (card ‘A) ∧ (AA ∧ ∀zAwA zw)) → ∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))))
178, 16mpan2i 522 . . . . . . . 8 (A ∈ On → (x = (card ‘A) → ∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))))
181719.21aiv 943 . . . . . . 7 (A ∈ On → ∀x(x = (card ‘A) → ∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))))
19 ss2ab 1551 . . . . . . 7 ({xx = (card ‘A)} ⊆ {x∣∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))} ↔ ∀x(x = (card ‘A) → ∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))))
2018, 19sylibr 175 . . . . . 6 (A ∈ On → {xx = (card ‘A)} ⊆ {x∣∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))})
21 df-sn 1811 . . . . . 6 {(card ‘A)} = {xx = (card ‘A)}
2220, 21syl5ss 1544 . . . . 5 (A ∈ On → {(card ‘A)} ⊆ {x∣∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))})
23 intss 1983 . . . . 5 ({(card ‘A)} ⊆ {x∣∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))} → {x∣∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))} ⊆ {(card ‘A)})
2422, 23syl 12 . . . 4 (A ∈ On → {x∣∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))} ⊆ {(card ‘A)})
25 fvex 2838 . . . . 5 (card ‘A) ∈ V
2625intsn 1991 . . . 4 {(card ‘A)} = (card ‘A)
2724, 26syl6ss 1546 . . 3 (A ∈ On → {x∣∃y(x = (card ‘y) ∧ (yA ∧ ∀zAwy zw))} ⊆ (card ‘A))
281, 27eqsstrd 1534 . 2 (A ∈ On → (cf ‘A) ⊆ (card ‘A))
29 0ss 1725 . . 3 ∅ ⊆ (card ‘A)
30 cffnon 3702 . . . . . . . 8 cf Fn On
31 fndm 2723 . . . . . . . 8 (cf Fn On → dom cf = On)
3230, 31ax-mp 6 . . . . . . 7 dom cf = On
3332eleq2i 1153 . . . . . 6 (A ∈ dom cf ↔ A ∈ On)
3433negbii 162 . . . . 5 A ∈ dom cf ↔ ¬ A ∈ On)
35 ndmfv 2848 . . . . 5 A ∈ dom cf → (cf ‘A) = ∅)
3634, 35sylbir 176 . . . 4 A ∈ On → (cf ‘A) = ∅)
3736sseq1d 1527 . . 3 A ∈ On → ((cf ‘A) ⊆ (card ‘A) ↔ ∅ ⊆ (card ‘A)))
3829, 37mpbiri 169 . 2 A ∈ On → (cf ‘A) ⊆ (card ‘A))
3928, 38pm2.61i 110 1 (cf ‘A) ⊆ (card ‘A)
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   → wi 2   ∧ wa 196  ∀wal 672  ∃wex 678  {cab 1090   = wceq 1091   ∈ wcel 1092  ∀wral 1201  ∃wrex 1202   ⊆ wss 1487  ∅c0 1707  {csn 1808  cint 1965  Oncon0 2199  dom cdm 2410   Fn wfn 2417   ‘cfv 2422  cardccrd 3620  cfccf 3622
This theorem is referenced by:  cfle 3708  cfom 3710
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
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-int 1966  df-br 2063  df-opab 2098  df-id 2125  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-fv 2438  df-cf 3625
metamath.org