Theorem cflecard 10251

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.

Step	Hyp	Ref	Expression
1		cfval 10245	. . 3 ⊢ (𝐴 ∈ On → (cf‘𝐴) = ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))})
2		df-sn 4629	. . . . . 6 ⊢ {(card‘𝐴)} = {𝑥 ∣ 𝑥 = (card‘𝐴)}
3		ssid 4004	. . . . . . . . 9 ⊢ 𝐴 ⊆ 𝐴
4		ssid 4004	. . . . . . . . . . 11 ⊢ 𝑧 ⊆ 𝑧
5		sseq2 4008	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑧 → (𝑧 ⊆ 𝑤 ↔ 𝑧 ⊆ 𝑧))
6	5	rspcev 3612	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑧 ⊆ 𝑧) → ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤)
7	4, 6	mpan2 688	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝐴 → ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤)
8	7	rgen 3062	. . . . . . . . 9 ⊢ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤
9	3, 8	pm3.2i 470	. . . . . . . 8 ⊢ (𝐴 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤)
10		fveq2 6891	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → (card‘𝑦) = (card‘𝐴))
11	10	eqeq2d 2742	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝑥 = (card‘𝑦) ↔ 𝑥 = (card‘𝐴)))
12		sseq1 4007	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → (𝑦 ⊆ 𝐴 ↔ 𝐴 ⊆ 𝐴))
13		rexeq 3320	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐴 → (∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤 ↔ ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤))
14	13	ralbidv 3176	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → (∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤 ↔ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤))
15	12, 14	anbi12d 630	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → ((𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤) ↔ (𝐴 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤)))
16	11, 15	anbi12d 630	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → ((𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤)) ↔ (𝑥 = (card‘𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤))))
17	16	spcegv 3587	. . . . . . . 8 ⊢ (𝐴 ∈ On → ((𝑥 = (card‘𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤)) → ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))))
18	9, 17	mpan2i 694	. . . . . . 7 ⊢ (𝐴 ∈ On → (𝑥 = (card‘𝐴) → ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))))
19	18	ss2abdv 4060	. . . . . 6 ⊢ (𝐴 ∈ On → {𝑥 ∣ 𝑥 = (card‘𝐴)} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))})
20	2, 19	eqsstrid 4030	. . . . 5 ⊢ (𝐴 ∈ On → {(card‘𝐴)} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))})
21		intss 4973	. . . . 5 ⊢ ({(card‘𝐴)} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))} → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))} ⊆ ∩ {(card‘𝐴)})
22	20, 21	syl 17	. . . 4 ⊢ (𝐴 ∈ On → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))} ⊆ ∩ {(card‘𝐴)})
23		fvex 6904	. . . . 5 ⊢ (card‘𝐴) ∈ V
24	23	intsn 4990	. . . 4 ⊢ ∩ {(card‘𝐴)} = (card‘𝐴)
25	22, 24	sseqtrdi 4032	. . 3 ⊢ (𝐴 ∈ On → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))} ⊆ (card‘𝐴))
26	1, 25	eqsstrd 4020	. 2 ⊢ (𝐴 ∈ On → (cf‘𝐴) ⊆ (card‘𝐴))
27		cff 10246	. . . . . 6 ⊢ cf:On⟶On
28	27	fdmi 6729	. . . . 5 ⊢ dom cf = On
29	28	eleq2i 2824	. . . 4 ⊢ (𝐴 ∈ dom cf ↔ 𝐴 ∈ On)
30		ndmfv 6926	. . . 4 ⊢ (¬ 𝐴 ∈ dom cf → (cf‘𝐴) = ∅)
31	29, 30	sylnbir 331	. . 3 ⊢ (¬ 𝐴 ∈ On → (cf‘𝐴) = ∅)
32		0ss 4396	. . 3 ⊢ ∅ ⊆ (card‘𝐴)
33	31, 32	eqsstrdi 4036	. 2 ⊢ (¬ 𝐴 ∈ On → (cf‘𝐴) ⊆ (card‘𝐴))
34	26, 33	pm2.61i 182	1 ⊢ (cf‘𝐴) ⊆ (card‘𝐴)

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1540  ∃wex 1780   ∈ wcel 2105  {cab 2708  ∀wral 3060  ∃wrex 3069   ⊆ wss 3948  ∅c0 4322  {csn 4628  ∩ cint 4950  dom cdm 5676  Oncon0 6364  ‘cfv 6543  cardccrd 9933  cfccf 9935

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-ord 6367  df-on 6368  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-card 9937  df-cf 9939

This theorem is referenced by:  cfle  10252