Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  cflecard Structured version   Visualization version   GIF version

Theorem cflecard 9020
 Description: Cofinality is bounded by the cardinality of its argument. (Contributed by NM, 24-Apr-2004.) (Revised by Mario Carneiro, 15-Sep-2013.)
Assertion
Ref Expression
cflecard (cf‘𝐴) ⊆ (card‘𝐴)

Proof of Theorem cflecard
Dummy variables 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cfval 9014 . . 3 (𝐴 ∈ On → (cf‘𝐴) = {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
2 df-sn 4154 . . . . . 6 {(card‘𝐴)} = {𝑥𝑥 = (card‘𝐴)}
3 ssid 3608 . . . . . . . . 9 𝐴𝐴
4 ssid 3608 . . . . . . . . . . 11 𝑧𝑧
5 sseq2 3611 . . . . . . . . . . . 12 (𝑤 = 𝑧 → (𝑧𝑤𝑧𝑧))
65rspcev 3300 . . . . . . . . . . 11 ((𝑧𝐴𝑧𝑧) → ∃𝑤𝐴 𝑧𝑤)
74, 6mpan2 706 . . . . . . . . . 10 (𝑧𝐴 → ∃𝑤𝐴 𝑧𝑤)
87rgen 2922 . . . . . . . . 9 𝑧𝐴𝑤𝐴 𝑧𝑤
93, 8pm3.2i 471 . . . . . . . 8 (𝐴𝐴 ∧ ∀𝑧𝐴𝑤𝐴 𝑧𝑤)
10 fveq2 6150 . . . . . . . . . . 11 (𝑦 = 𝐴 → (card‘𝑦) = (card‘𝐴))
1110eqeq2d 2636 . . . . . . . . . 10 (𝑦 = 𝐴 → (𝑥 = (card‘𝑦) ↔ 𝑥 = (card‘𝐴)))
12 sseq1 3610 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝑦𝐴𝐴𝐴))
13 rexeq 3133 . . . . . . . . . . . 12 (𝑦 = 𝐴 → (∃𝑤𝑦 𝑧𝑤 ↔ ∃𝑤𝐴 𝑧𝑤))
1413ralbidv 2985 . . . . . . . . . . 11 (𝑦 = 𝐴 → (∀𝑧𝐴𝑤𝑦 𝑧𝑤 ↔ ∀𝑧𝐴𝑤𝐴 𝑧𝑤))
1512, 14anbi12d 746 . . . . . . . . . 10 (𝑦 = 𝐴 → ((𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤) ↔ (𝐴𝐴 ∧ ∀𝑧𝐴𝑤𝐴 𝑧𝑤)))
1611, 15anbi12d 746 . . . . . . . . 9 (𝑦 = 𝐴 → ((𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) ↔ (𝑥 = (card‘𝐴) ∧ (𝐴𝐴 ∧ ∀𝑧𝐴𝑤𝐴 𝑧𝑤))))
1716spcegv 3285 . . . . . . . 8 (𝐴 ∈ On → ((𝑥 = (card‘𝐴) ∧ (𝐴𝐴 ∧ ∀𝑧𝐴𝑤𝐴 𝑧𝑤)) → ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))))
189, 17mpan2i 712 . . . . . . 7 (𝐴 ∈ On → (𝑥 = (card‘𝐴) → ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))))
1918ss2abdv 3659 . . . . . 6 (𝐴 ∈ On → {𝑥𝑥 = (card‘𝐴)} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
202, 19syl5eqss 3633 . . . . 5 (𝐴 ∈ On → {(card‘𝐴)} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))})
21 intss 4468 . . . . 5 ({(card‘𝐴)} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ⊆ {(card‘𝐴)})
2220, 21syl 17 . . . 4 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ⊆ {(card‘𝐴)})
23 fvex 6160 . . . . 5 (card‘𝐴) ∈ V
2423intsn 4483 . . . 4 {(card‘𝐴)} = (card‘𝐴)
2522, 24syl6sseq 3635 . . 3 (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))} ⊆ (card‘𝐴))
261, 25eqsstrd 3623 . 2 (𝐴 ∈ On → (cf‘𝐴) ⊆ (card‘𝐴))
27 cff 9015 . . . . . 6 cf:On⟶On
2827fdmi 6011 . . . . 5 dom cf = On
2928eleq2i 2696 . . . 4 (𝐴 ∈ dom cf ↔ 𝐴 ∈ On)
30 ndmfv 6176 . . . 4 𝐴 ∈ dom cf → (cf‘𝐴) = ∅)
3129, 30sylnbir 321 . . 3 𝐴 ∈ On → (cf‘𝐴) = ∅)
32 0ss 3949 . . 3 ∅ ⊆ (card‘𝐴)
3331, 32syl6eqss 3639 . 2 𝐴 ∈ On → (cf‘𝐴) ⊆ (card‘𝐴))
3426, 33pm2.61i 176 1 (cf‘𝐴) ⊆ (card‘𝐴)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ∧ wa 384   = wceq 1480  ∃wex 1701   ∈ wcel 1992  {cab 2612  ∀wral 2912  ∃wrex 2913   ⊆ wss 3560  ∅c0 3896  {csn 4153  ∩ cint 4445  dom cdm 5079  Oncon0 5685  ‘cfv 5850  cardccrd 8706  cfccf 8708 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-8 1994  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6903 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-eu 2478  df-mo 2479  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-ne 2797  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3193  df-sbc 3423  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-pss 3576  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-tp 4158  df-op 4160  df-uni 4408  df-int 4446  df-br 4619  df-opab 4679  df-mpt 4680  df-tr 4718  df-eprel 4990  df-id 4994  df-po 5000  df-so 5001  df-fr 5038  df-we 5040  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-ord 5688  df-on 5689  df-iota 5813  df-fun 5852  df-fn 5853  df-f 5854  df-fv 5858  df-card 8710  df-cf 8712 This theorem is referenced by:  cfle  9021
 Copyright terms: Public domain W3C validator