cfss - Metamath Proof Explorer

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

Theorem cfss 10257

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 10254	. . . . 5 ⊢ (Lim 𝐴 → (cf‘𝐴) = ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥))
3		fvex 6902	. . . . . . 7 ⊢ (card‘𝑥) ∈ V
4	3	dfiin2 5037	. . . . . 6 ⊢ ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)}
5		cardon 9936	. . . . . . . . . 10 ⊢ (card‘𝑥) ∈ On
6		eleq1 2822	. . . . . . . . . 10 ⊢ (𝑦 = (card‘𝑥) → (𝑦 ∈ On ↔ (card‘𝑥) ∈ On))
7	5, 6	mpbiri 258	. . . . . . . . 9 ⊢ (𝑦 = (card‘𝑥) → 𝑦 ∈ On)
8	7	rexlimivw 3152	. . . . . . . 8 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) → 𝑦 ∈ On)
9	8	abssi 4067	. . . . . . 7 ⊢ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ⊆ On
10		limuni 6423	. . . . . . . . . . . 12 ⊢ (Lim 𝐴 → 𝐴 = ∪ 𝐴)
11	10	eqcomd 2739	. . . . . . . . . . 11 ⊢ (Lim 𝐴 → ∪ 𝐴 = 𝐴)
12		fveq2 6889	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝐴 → (card‘𝑥) = (card‘𝐴))
13	12	eqcomd 2739	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → (card‘𝐴) = (card‘𝑥))
14	13	biantrud 533	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → (∪ 𝐴 = 𝐴 ↔ (∪ 𝐴 = 𝐴 ∧ (card‘𝐴) = (card‘𝑥))))
15		unieq 4919	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴)
16	15	eqeq1d 2735	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 = 𝐴 ↔ ∪ 𝐴 = 𝐴))
17	1	pwid 4624	. . . . . . . . . . . . . . . . 17 ⊢ 𝐴 ∈ 𝒫 𝐴
18		eleq1 2822	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝒫 𝐴 ↔ 𝐴 ∈ 𝒫 𝐴))
19	17, 18	mpbiri 258	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝐴 → 𝑥 ∈ 𝒫 𝐴)
20	19	biantrurd 534	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 = 𝐴 ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴)))
21	16, 20	bitr3d 281	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → (∪ 𝐴 = 𝐴 ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴)))
22	21	anbi1d 631	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → ((∪ 𝐴 = 𝐴 ∧ (card‘𝐴) = (card‘𝑥)) ↔ ((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥))))
23	14, 22	bitr2d 280	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)) ↔ ∪ 𝐴 = 𝐴))
24	1, 23	spcev 3597	. . . . . . . . . . 11 ⊢ (∪ 𝐴 = 𝐴 → ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
25	11, 24	syl 17	. . . . . . . . . 10 ⊢ (Lim 𝐴 → ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
26		df-rex 3072	. . . . . . . . . . 11 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)))
27		rabid 3453	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴))
28	27	anbi1i 625	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)) ↔ ((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
29	28	exbii 1851	. . . . . . . . . . 11 ⊢ (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)) ↔ ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
30	26, 29	bitri 275	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) ↔ ∃𝑥((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
31	25, 30	sylibr 233	. . . . . . . . 9 ⊢ (Lim 𝐴 → ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥))
32		fvex 6902	. . . . . . . . . 10 ⊢ (card‘𝐴) ∈ V
33		eqeq1 2737	. . . . . . . . . . 11 ⊢ (𝑦 = (card‘𝐴) → (𝑦 = (card‘𝑥) ↔ (card‘𝐴) = (card‘𝑥)))
34	33	rexbidv 3179	. . . . . . . . . 10 ⊢ (𝑦 = (card‘𝐴) → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥)))
35	32, 34	spcev 3597	. . . . . . . . 9 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) → ∃𝑦∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥))
36	31, 35	syl 17	. . . . . . . 8 ⊢ (Lim 𝐴 → ∃𝑦∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥))
37		abn0 4380	. . . . . . . 8 ⊢ ({𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅ ↔ ∃𝑦∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥))
38	36, 37	sylibr 233	. . . . . . 7 ⊢ (Lim 𝐴 → {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅)
39		onint 7775	. . . . . . 7 ⊢ (({𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ⊆ On ∧ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅) → ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
40	9, 38, 39	sylancr 588	. . . . . 6 ⊢ (Lim 𝐴 → ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
41	4, 40	eqeltrid 2838	. . . . 5 ⊢ (Lim 𝐴 → ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
42	2, 41	eqeltrd 2834	. . . 4 ⊢ (Lim 𝐴 → (cf‘𝐴) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
43		fvex 6902	. . . . 5 ⊢ (cf‘𝐴) ∈ V
44		eqeq1 2737	. . . . . 6 ⊢ (𝑦 = (cf‘𝐴) → (𝑦 = (card‘𝑥) ↔ (cf‘𝐴) = (card‘𝑥)))
45	44	rexbidv 3179	. . . . 5 ⊢ (𝑦 = (cf‘𝐴) → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥)))
46	43, 45	elab 3668	. . . 4 ⊢ ((cf‘𝐴) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥))
47	42, 46	sylib 217	. . 3 ⊢ (Lim 𝐴 → ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥))
48		df-rex 3072	. . 3 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)))
49	47, 48	sylib 217	. 2 ⊢ (Lim 𝐴 → ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)))
50		simprl 770	. . . . . . . 8 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴})
51	50, 27	sylib 217	. . . . . . 7 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴))
52	51	simpld 496	. . . . . 6 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ∈ 𝒫 𝐴)
53	52	elpwid 4611	. . . . 5 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ⊆ 𝐴)
54		simpl 484	. . . . . . 7 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → Lim 𝐴)
55		vex 3479	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
56		limord 6422	. . . . . . . . . . . 12 ⊢ (Lim 𝐴 → Ord 𝐴)
57		ordsson 7767	. . . . . . . . . . . 12 ⊢ (Ord 𝐴 → 𝐴 ⊆ On)
58	56, 57	syl 17	. . . . . . . . . . 11 ⊢ (Lim 𝐴 → 𝐴 ⊆ On)
59		sstr 3990	. . . . . . . . . . 11 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝐴 ⊆ On) → 𝑥 ⊆ On)
60	58, 59	sylan2 594	. . . . . . . . . 10 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → 𝑥 ⊆ On)
61		onssnum 10032	. . . . . . . . . 10 ⊢ ((𝑥 ∈ V ∧ 𝑥 ⊆ On) → 𝑥 ∈ dom card)
62	55, 60, 61	sylancr 588	. . . . . . . . 9 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → 𝑥 ∈ dom card)
63		cardid2 9945	. . . . . . . . 9 ⊢ (𝑥 ∈ dom card → (card‘𝑥) ≈ 𝑥)
64	62, 63	syl 17	. . . . . . . 8 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → (card‘𝑥) ≈ 𝑥)
65	64	ensymd 8998	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ Lim 𝐴) → 𝑥 ≈ (card‘𝑥))
66	53, 54, 65	syl2anc 585	. . . . . 6 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ≈ (card‘𝑥))
67		simprr 772	. . . . . 6 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (cf‘𝐴) = (card‘𝑥))
68	66, 67	breqtrrd 5176	. . . . 5 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ≈ (cf‘𝐴))
69	51	simprd 497	. . . . 5 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → ∪ 𝑥 = 𝐴)
70	53, 68, 69	3jca 1129	. . . 4 ⊢ ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴))
71	70	ex 414	. . 3 ⊢ (Lim 𝐴 → ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)) → (𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴)))
72	71	eximdv 1921	. 2 ⊢ (Lim 𝐴 → (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴)))
73	49, 72	mpd 15	1 ⊢ (Lim 𝐴 → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ (cf‘𝐴) ∧ ∪ 𝑥 = 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∃wex 1782 ∈ wcel 2107 {cab 2710 ≠ wne 2941 ∃wrex 3071 {crab 3433 Vcvv 3475 ⊆ wss 3948 ∅c0 4322 𝒫 cpw 4602 ∪ cuni 4908 ∩ cint 4950 ∩ ciin 4998 class class class wbr 5148 dom cdm 5676 Ord word 6361 Oncon0 6362 Lim wlim 6363 ‘cfv 6541 ≈ cen 8933 cardccrd 9927 cfccf 9929

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 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-iun 4999 df-iin 5000 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-se 5632 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-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-isom 6550 df-riota 7362 df-ov 7409 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-er 8700 df-en 8937 df-dom 8938 df-card 9931 df-cf 9933

This theorem is referenced by: (None)

W3C validator