Metamath Proof Explorer


Theorem cfslb

Description: Any cofinal subset of A is at least as large as ( cfA ) . (Contributed by Mario Carneiro, 24-Jun-2013)

Ref Expression
Hypothesis cfslb.1 ⊢ A ∈ V
Assertion cfslb ⊢ Lim ⁡ A ∧ B ⊆ A ∧ ⋃ B = A → cf ⁡ A ≼ B

Proof

Step Hyp Ref Expression
1 cfslb.1 ⊢ A ∈ V
2 fvex ⊢ card ⁡ B ∈ V
3 ssid ⊢ card ⁡ B ⊆ card ⁡ B
4 1 ssex ⊢ B ⊆ A → B ∈ V
5 4 ad2antrr ⊢ B ⊆ A ∧ ⋃ B = A ∧ card ⁡ B ⊆ card ⁡ B → B ∈ V
6 velpw ⊢ x ∈ 𝒫 A ↔ x ⊆ A
7 sseq1 ⊢ x = B → x ⊆ A ↔ B ⊆ A
8 6 7 bitrid ⊢ x = B → x ∈ 𝒫 A ↔ B ⊆ A
9 unieq ⊢ x = B → ⋃ x = ⋃ B
10 9 eqeq1d ⊢ x = B → ⋃ x = A ↔ ⋃ B = A
11 8 10 anbi12d ⊢ x = B → x ∈ 𝒫 A ∧ ⋃ x = A ↔ B ⊆ A ∧ ⋃ B = A
12 fveq2 ⊢ x = B → card ⁡ x = card ⁡ B
13 12 sseq1d ⊢ x = B → card ⁡ x ⊆ card ⁡ B ↔ card ⁡ B ⊆ card ⁡ B
14 11 13 anbi12d ⊢ x = B → x ∈ 𝒫 A ∧ ⋃ x = A ∧ card ⁡ x ⊆ card ⁡ B ↔ B ⊆ A ∧ ⋃ B = A ∧ card ⁡ B ⊆ card ⁡ B
15 14 spcegv ⊢ B ∈ V → B ⊆ A ∧ ⋃ B = A ∧ card ⁡ B ⊆ card ⁡ B → ∃ x x ∈ 𝒫 A ∧ ⋃ x = A ∧ card ⁡ x ⊆ card ⁡ B
16 5 15 mpcom ⊢ B ⊆ A ∧ ⋃ B = A ∧ card ⁡ B ⊆ card ⁡ B → ∃ x x ∈ 𝒫 A ∧ ⋃ x = A ∧ card ⁡ x ⊆ card ⁡ B
17 df-rex ⊢ ∃ x ∈ x ∈ 𝒫 A | ⋃ x = A card ⁡ x ⊆ card ⁡ B ↔ ∃ x x ∈ x ∈ 𝒫 A | ⋃ x = A ∧ card ⁡ x ⊆ card ⁡ B
18 rabid ⊢ x ∈ x ∈ 𝒫 A | ⋃ x = A ↔ x ∈ 𝒫 A ∧ ⋃ x = A
19 18 anbi1i ⊢ x ∈ x ∈ 𝒫 A | ⋃ x = A ∧ card ⁡ x ⊆ card ⁡ B ↔ x ∈ 𝒫 A ∧ ⋃ x = A ∧ card ⁡ x ⊆ card ⁡ B
20 19 exbii ⊢ ∃ x x ∈ x ∈ 𝒫 A | ⋃ x = A ∧ card ⁡ x ⊆ card ⁡ B ↔ ∃ x x ∈ 𝒫 A ∧ ⋃ x = A ∧ card ⁡ x ⊆ card ⁡ B
21 17 20 bitri ⊢ ∃ x ∈ x ∈ 𝒫 A | ⋃ x = A card ⁡ x ⊆ card ⁡ B ↔ ∃ x x ∈ 𝒫 A ∧ ⋃ x = A ∧ card ⁡ x ⊆ card ⁡ B
22 16 21 sylibr ⊢ B ⊆ A ∧ ⋃ B = A ∧ card ⁡ B ⊆ card ⁡ B → ∃ x ∈ x ∈ 𝒫 A | ⋃ x = A card ⁡ x ⊆ card ⁡ B
23 3 22 mpan2 ⊢ B ⊆ A ∧ ⋃ B = A → ∃ x ∈ x ∈ 𝒫 A | ⋃ x = A card ⁡ x ⊆ card ⁡ B
24 iinss ⊢ ∃ x ∈ x ∈ 𝒫 A | ⋃ x = A card ⁡ x ⊆ card ⁡ B → ⋂ x ∈ x ∈ 𝒫 A | ⋃ x = A card ⁡ x ⊆ card ⁡ B
25 23 24 syl ⊢ B ⊆ A ∧ ⋃ B = A → ⋂ x ∈ x ∈ 𝒫 A | ⋃ x = A card ⁡ x ⊆ card ⁡ B
26 1 cflim3 ⊢ Lim ⁡ A → cf ⁡ A = ⋂ x ∈ x ∈ 𝒫 A | ⋃ x = A card ⁡ x
27 26 sseq1d ⊢ Lim ⁡ A → cf ⁡ A ⊆ card ⁡ B ↔ ⋂ x ∈ x ∈ 𝒫 A | ⋃ x = A card ⁡ x ⊆ card ⁡ B
28 25 27 imbitrrid ⊢ Lim ⁡ A → B ⊆ A ∧ ⋃ B = A → cf ⁡ A ⊆ card ⁡ B
29 28 3impib ⊢ Lim ⁡ A ∧ B ⊆ A ∧ ⋃ B = A → cf ⁡ A ⊆ card ⁡ B
30 ssdomg ⊢ card ⁡ B ∈ V → cf ⁡ A ⊆ card ⁡ B → cf ⁡ A ≼ card ⁡ B
31 2 29 30 mpsyl ⊢ Lim ⁡ A ∧ B ⊆ A ∧ ⋃ B = A → cf ⁡ A ≼ card ⁡ B
32 limord ⊢ Lim ⁡ A → Ord ⁡ A
33 ordsson ⊢ Ord ⁡ A → A ⊆ On
34 32 33 syl ⊢ Lim ⁡ A → A ⊆ On
35 sstr2 ⊢ B ⊆ A → A ⊆ On → B ⊆ On
36 34 35 mpan9 ⊢ Lim ⁡ A ∧ B ⊆ A → B ⊆ On
37 onssnum ⊢ B ∈ V ∧ B ⊆ On → B ∈ dom ⁡ card
38 4 36 37 syl2an2 ⊢ Lim ⁡ A ∧ B ⊆ A → B ∈ dom ⁡ card
39 cardid2 ⊢ B ∈ dom ⁡ card → card ⁡ B ≈ B
40 38 39 syl ⊢ Lim ⁡ A ∧ B ⊆ A → card ⁡ B ≈ B
41 40 3adant3 ⊢ Lim ⁡ A ∧ B ⊆ A ∧ ⋃ B = A → card ⁡ B ≈ B
42 domentr ⊢ cf ⁡ A ≼ card ⁡ B ∧ card ⁡ B ≈ B → cf ⁡ A ≼ B
43 31 41 42 syl2anc ⊢ Lim ⁡ A ∧ B ⊆ A ∧ ⋃ B = A → cf ⁡ A ≼ B