Theorem cfss 10219

Description: There is a cofinal subset of 𝐴 of cardinality (cf‘𝐴). (Contributed by Mario Carneiro, 24-Jun-2013.)

Hypothesis

Ref	Expression
cfss.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
cfss	⊢ (Lim 𝐴 → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴))

Distinct variable group:   𝑥,𝐴

Proof of Theorem cfss

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cfss.1	. . . . . 6 ⊢ 𝐴 ∈ V
2	1	cflim3 10216	. . . . 5 ⊢ (Lim 𝐴 → (cf‘𝐴) = ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥))
3		fvex 6876	. . . . . . 7 ⊢ (card‘𝑥) ∈ V
4	3	dfiin2 4989	. . . . . 6 ⊢ ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)}
5		cardon 9899	. . . . . . . . . 10 ⊢ (card‘𝑥) ∈ On
6		eleq1 2849	. . . . . . . . . 10 ⊢ (𝑦 = (card‘𝑥) → (𝑦 ∈ On ↔ (card‘𝑥) ∈ On))
7	5, 6	mpbiri 260	. . . . . . . . 9 ⊢ (𝑦 = (card‘𝑥) → 𝑦 ∈ On)
8	7	rexlimivw 3158	. . . . . . . 8 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) → 𝑦 ∈ On)
9	8	abssi 4021	. . . . . . 7 ⊢ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ⊆ On
10		limuni 6404	. . . . . . . . . . . 12 ⊢ (Lim 𝐴 → 𝐴 = ∪ 𝐴)
11	10	eqcomd 2767	. . . . . . . . . . 11 ⊢ (Lim 𝐴 → ∪ 𝐴 = 𝐴)
12		fveq2 6863	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝐴 → (card‘𝑥) = (card‘𝐴))
13	12	eqcomd 2767	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → (card‘𝐴) = (card‘𝑥))
14	13	biantrud 539	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → (∪ 𝐴 = 𝐴 ↔ (∪ 𝐴 = 𝐴 ∧ (card‘𝐴) = (card‘𝑥))))
15		unieq 4875	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴)
16	15	eqeq1d 2763	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 = 𝐴 ↔ ∪ 𝐴 = 𝐴))
17	1	pwid 4577	. . . . . . . . . . . . . . . . 17 ⊢ 𝐴 ∈ 𝒫 𝐴
18		eleq1 2849	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝒫 𝐴 ↔ 𝐴 ∈ 𝒫 𝐴))
19	17, 18	mpbiri 260	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝐴 → 𝑥 ∈ 𝒫 𝐴)
20	19	biantrurd 540	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 = 𝐴 ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴)))
21	16, 20	bitr3d 283	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → (∪ 𝐴 = 𝐴 ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴)))
22	21	anbi1d 640	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → ((∪ 𝐴 = 𝐴 ∧ (card‘𝐴) = (card‘𝑥)) ↔ ((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥))))
23	14, 22	bitr2d 282	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)) ↔ ∪ 𝐴 = 𝐴))
24	1, 23	spcev 3565	. . . . . . . . . . 11 ⊢ (∪ 𝐴 = 𝐴 → ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
25	11, 24	syl 17	. . . . . . . . . 10 ⊢ (Lim 𝐴 → ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
26		df-rex 3086	. . . . . . . . . . 11 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)))
27		rabid 3434	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴))
28	27	anbi1i 633	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)) ↔ ((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
29	28	exbii 1867	. . . . . . . . . . 11 ⊢ (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)) ↔ ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
30	26, 29	bitri 277	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) ↔ ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
31	25, 30	sylibr 236	. . . . . . . . 9 ⊢ (Lim 𝐴 → ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥))
32		fvex 6876	. . . . . . . . . 10 ⊢ (card‘𝐴) ∈ V
33		eqeq1 2765	. . . . . . . . . . 11 ⊢ (𝑦 = (card‘𝐴) → (𝑦 = (card‘𝑥) ↔ (card‘𝐴) = (card‘𝑥)))
34	33	rexbidv 3185	. . . . . . . . . 10 ⊢ (𝑦 = (card‘𝐴) → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥)))
35	32, 34	spcev 3565	. . . . . . . . 9 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) → ∃𝑦∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥))
36	31, 35	syl 17	. . . . . . . 8 ⊢ (Lim 𝐴 → ∃𝑦∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥))
37		abn0 4337	. . . . . . . 8 ⊢ ({𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅ ↔ ∃𝑦∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥))
38	36, 37	sylibr 236	. . . . . . 7 ⊢ (Lim 𝐴 → {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅)
39		onint 7769	. . . . . . 7 ⊢ (({𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ⊆ On ∧ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅) → ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
40	9, 38, 39	sylancr 596	. . . . . 6 ⊢ (Lim 𝐴 → ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
41	4, 40	eqeltrid 2865	. . . . 5 ⊢ (Lim 𝐴 → ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
42	2, 41	eqeltrd 2861	. . . 4 ⊢ (Lim 𝐴 → (cf‘𝐴) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
43		fvex 6876	. . . . 5 ⊢ (cf‘𝐴) ∈ V
44		eqeq1 2765	. . . . . 6 ⊢ (𝑦 = (cf‘𝐴) → (𝑦 = (card‘𝑥) ↔ (cf‘𝐴) = (card‘𝑥)))
45	44	rexbidv 3185	. . . . 5 ⊢ (𝑦 = (cf‘𝐴) → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥)))
46	43, 45	elab 3638	. . . 4 ⊢ ((cf‘𝐴) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥))
47	42, 46	sylib 220	. . 3 ⊢ (Lim 𝐴 → ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥))
48		df-rex 3086	. . 3 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)))
49	47, 48	sylib 220	. 2 ⊢ (Lim 𝐴 → ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)))
50		simprl 780	. . . . . . . 8 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴})
51	50, 27	sylib 220	. . . . . . 7 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴))
52	51	simpld 498	. . . . . 6 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ∈ 𝒫 𝐴)
53	52	elpwid 4563	. . . . 5 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ⊆ 𝐴)
54		simpl 486	. . . . . . 7 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → Lim 𝐴)
55		vex 3457	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
56		limord 6403	. . . . . . . . . . . 12 ⊢ (Lim 𝐴 → Ord 𝐴)
57		ordsson 7762	. . . . . . . . . . . 12 ⊢ (Ord 𝐴 → 𝐴 ⊆ On)
58	56, 57	syl 17	. . . . . . . . . . 11 ⊢ (Lim 𝐴 → 𝐴 ⊆ On)
59		sstr 3944	. . . . . . . . . . 11 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝐴 ⊆ On) → 𝑥 ⊆ On)
60	58, 59	sylan2 602	. . . . . . . . . 10 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → 𝑥 ⊆ On)
61		onssnum 9993	. . . . . . . . . 10 ⊢ ((𝑥 ∈ V ∧ 𝑥 ⊆ On) → 𝑥 ∈ dom card)
62	55, 60, 61	sylancr 596	. . . . . . . . 9 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → 𝑥 ∈ dom card)
63		cardid2 9908	. . . . . . . . 9 ⊢ (𝑥 ∈ dom card → (card‘𝑥) ≈ 𝑥)
64	62, 63	syl 17	. . . . . . . 8 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → (card‘𝑥) ≈ 𝑥)
65	64	ensymd 8982	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → 𝑥 ≈ (card‘𝑥))
66	53, 54, 65	syl2anc 593	. . . . . 6 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ≈ (card‘𝑥))
67		simprr 782	. . . . . 6 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (cf‘𝐴) = (card‘𝑥))
68	66, 67	breqtrrd 5127	. . . . 5 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ≈ (cf‘𝐴))
69	51	simprd 499	. . . . 5 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → ∪ 𝑥 = 𝐴)
70	53, 68, 69	3jca 1140	. . . 4 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴))
71	70	ex 416	. . 3 ⊢ (Lim 𝐴 → ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)) → (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴)))
72	71	eximdv 1936	. 2 ⊢ (Lim 𝐴 → (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴)))
73	49, 72	mpd 15	1 ⊢ (Lim 𝐴 → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1097   = wceq 1559  ∃wex 1798   ∈ wcel 2141  {cab 2739   ≠ wne 2956  ∃wrex 3085  {crab 3413  Vcvv 3453   ⊆ wss 3904  ∅c0 4285  𝒫 cpw 4554  ∪ cuni 4864  ∩ cint 4904  ∩ ciin 4949   class class class wbr 5099  dom cdm 5645  Ord word 6341  Oncon0 6342  Lim wlim 6343  ‘cfv 6517   ≈ cen 8920  cardccrd 9890  cfccf 9892

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4905  df-iun 4950  df-iin 4951  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-se 5599  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-pred 6284  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-isom 6526  df-riota 7349  df-ov 7395  df-2nd 7967  df-frecs 8257  df-wrecs 8288  df-recs 8337  df-er 8673  df-en 8924  df-dom 8925  df-card 9894  df-cf 9896

This theorem is referenced by: (None)