Theorem cfss 10187

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 10184	. . . . 5 ⊢ (Lim 𝐴 → (cf‘𝐴) = ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥))
3		fvex 6855	. . . . . . 7 ⊢ (card‘𝑥) ∈ V
4	3	dfiin2 4990	. . . . . 6 ⊢ ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)}
5		cardon 9868	. . . . . . . . . 10 ⊢ (card‘𝑥) ∈ On
6		eleq1 2825	. . . . . . . . . 10 ⊢ (𝑦 = (card‘𝑥) → (𝑦 ∈ On ↔ (card‘𝑥) ∈ On))
7	5, 6	mpbiri 258	. . . . . . . . 9 ⊢ (𝑦 = (card‘𝑥) → 𝑦 ∈ On)
8	7	rexlimivw 3135	. . . . . . . 8 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) → 𝑦 ∈ On)
9	8	abssi 4022	. . . . . . 7 ⊢ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ⊆ On
10		limuni 6387	. . . . . . . . . . . 12 ⊢ (Lim 𝐴 → 𝐴 = ∪ 𝐴)
11	10	eqcomd 2743	. . . . . . . . . . 11 ⊢ (Lim 𝐴 → ∪ 𝐴 = 𝐴)
12		fveq2 6842	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝐴 → (card‘𝑥) = (card‘𝐴))
13	12	eqcomd 2743	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → (card‘𝐴) = (card‘𝑥))
14	13	biantrud 531	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → (∪ 𝐴 = 𝐴 ↔ (∪ 𝐴 = 𝐴 ∧ (card‘𝐴) = (card‘𝑥))))
15		unieq 4876	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴)
16	15	eqeq1d 2739	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 = 𝐴 ↔ ∪ 𝐴 = 𝐴))
17	1	pwid 4578	. . . . . . . . . . . . . . . . 17 ⊢ 𝐴 ∈ 𝒫 𝐴
18		eleq1 2825	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝒫 𝐴 ↔ 𝐴 ∈ 𝒫 𝐴))
19	17, 18	mpbiri 258	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝐴 → 𝑥 ∈ 𝒫 𝐴)
20	19	biantrurd 532	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 = 𝐴 ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴)))
21	16, 20	bitr3d 281	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → (∪ 𝐴 = 𝐴 ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴)))
22	21	anbi1d 632	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → ((∪ 𝐴 = 𝐴 ∧ (card‘𝐴) = (card‘𝑥)) ↔ ((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥))))
23	14, 22	bitr2d 280	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)) ↔ ∪ 𝐴 = 𝐴))
24	1, 23	spcev 3562	. . . . . . . . . . 11 ⊢ (∪ 𝐴 = 𝐴 → ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
25	11, 24	syl 17	. . . . . . . . . 10 ⊢ (Lim 𝐴 → ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
26		df-rex 3063	. . . . . . . . . . 11 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)))
27		rabid 3422	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴))
28	27	anbi1i 625	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)) ↔ ((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
29	28	exbii 1850	. . . . . . . . . . 11 ⊢ (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)) ↔ ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
30	26, 29	bitri 275	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) ↔ ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
31	25, 30	sylibr 234	. . . . . . . . 9 ⊢ (Lim 𝐴 → ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥))
32		fvex 6855	. . . . . . . . . 10 ⊢ (card‘𝐴) ∈ V
33		eqeq1 2741	. . . . . . . . . . 11 ⊢ (𝑦 = (card‘𝐴) → (𝑦 = (card‘𝑥) ↔ (card‘𝐴) = (card‘𝑥)))
34	33	rexbidv 3162	. . . . . . . . . 10 ⊢ (𝑦 = (card‘𝐴) → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥)))
35	32, 34	spcev 3562	. . . . . . . . 9 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) → ∃𝑦∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥))
36	31, 35	syl 17	. . . . . . . 8 ⊢ (Lim 𝐴 → ∃𝑦∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥))
37		abn0 4339	. . . . . . . 8 ⊢ ({𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅ ↔ ∃𝑦∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥))
38	36, 37	sylibr 234	. . . . . . 7 ⊢ (Lim 𝐴 → {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅)
39		onint 7745	. . . . . . 7 ⊢ (({𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ⊆ On ∧ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅) → ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
40	9, 38, 39	sylancr 588	. . . . . 6 ⊢ (Lim 𝐴 → ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
41	4, 40	eqeltrid 2841	. . . . 5 ⊢ (Lim 𝐴 → ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
42	2, 41	eqeltrd 2837	. . . 4 ⊢ (Lim 𝐴 → (cf‘𝐴) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
43		fvex 6855	. . . . 5 ⊢ (cf‘𝐴) ∈ V
44		eqeq1 2741	. . . . . 6 ⊢ (𝑦 = (cf‘𝐴) → (𝑦 = (card‘𝑥) ↔ (cf‘𝐴) = (card‘𝑥)))
45	44	rexbidv 3162	. . . . 5 ⊢ (𝑦 = (cf‘𝐴) → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥)))
46	43, 45	elab 3636	. . . 4 ⊢ ((cf‘𝐴) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥))
47	42, 46	sylib 218	. . 3 ⊢ (Lim 𝐴 → ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥))
48		df-rex 3063	. . 3 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)))
49	47, 48	sylib 218	. 2 ⊢ (Lim 𝐴 → ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)))
50		simprl 771	. . . . . . . 8 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴})
51	50, 27	sylib 218	. . . . . . 7 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴))
52	51	simpld 494	. . . . . 6 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ∈ 𝒫 𝐴)
53	52	elpwid 4565	. . . . 5 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ⊆ 𝐴)
54		simpl 482	. . . . . . 7 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → Lim 𝐴)
55		vex 3446	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
56		limord 6386	. . . . . . . . . . . 12 ⊢ (Lim 𝐴 → Ord 𝐴)
57		ordsson 7738	. . . . . . . . . . . 12 ⊢ (Ord 𝐴 → 𝐴 ⊆ On)
58	56, 57	syl 17	. . . . . . . . . . 11 ⊢ (Lim 𝐴 → 𝐴 ⊆ On)
59		sstr 3944	. . . . . . . . . . 11 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝐴 ⊆ On) → 𝑥 ⊆ On)
60	58, 59	sylan2 594	. . . . . . . . . 10 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → 𝑥 ⊆ On)
61		onssnum 9962	. . . . . . . . . 10 ⊢ ((𝑥 ∈ V ∧ 𝑥 ⊆ On) → 𝑥 ∈ dom card)
62	55, 60, 61	sylancr 588	. . . . . . . . 9 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → 𝑥 ∈ dom card)
63		cardid2 9877	. . . . . . . . 9 ⊢ (𝑥 ∈ dom card → (card‘𝑥) ≈ 𝑥)
64	62, 63	syl 17	. . . . . . . 8 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → (card‘𝑥) ≈ 𝑥)
65	64	ensymd 8954	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → 𝑥 ≈ (card‘𝑥))
66	53, 54, 65	syl2anc 585	. . . . . 6 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ≈ (card‘𝑥))
67		simprr 773	. . . . . 6 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (cf‘𝐴) = (card‘𝑥))
68	66, 67	breqtrrd 5128	. . . . 5 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ≈ (cf‘𝐴))
69	51	simprd 495	. . . . 5 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → ∪ 𝑥 = 𝐴)
70	53, 68, 69	3jca 1129	. . . 4 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴))
71	70	ex 412	. . 3 ⊢ (Lim 𝐴 → ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)) → (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴)))
72	71	eximdv 1919	. 2 ⊢ (Lim 𝐴 → (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴)))
73	49, 72	mpd 15	1 ⊢ (Lim 𝐴 → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  {cab 2715   ≠ wne 2933  ∃wrex 3062  {crab 3401  Vcvv 3442   ⊆ wss 3903  ∅c0 4287  𝒫 cpw 4556  ∪ cuni 4865  ∩ cint 4904  ∩ ciin 4949   class class class wbr 5100  dom cdm 5632  Ord word 6324  Oncon0 6325  Lim wlim 6326  ‘cfv 6500   ≈ cen 8892  cardccrd 9859  cfccf 9861

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-iin 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509  df-riota 7325  df-ov 7371  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-er 8645  df-en 8896  df-dom 8897  df-card 9863  df-cf 9865

This theorem is referenced by: (None)