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

Theorem cfss 10185
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.
StepHypRef Expression
1 cfss.1 . . . . . 6 𝐴 ∈ V
21cflim3 10182 . . . . 5 (Lim 𝐴 → (cf‘𝐴) = 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥))
3 fvex 6847 . . . . . . 7 (card‘𝑥) ∈ V
43dfiin2 4969 . . . . . 6 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥) = {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)}
5 cardon 9866 . . . . . . . . . 10 (card‘𝑥) ∈ On
6 eleq1 2828 . . . . . . . . . 10 (𝑦 = (card‘𝑥) → (𝑦 ∈ On ↔ (card‘𝑥) ∈ On))
75, 6mpbiri 259 . . . . . . . . 9 (𝑦 = (card‘𝑥) → 𝑦 ∈ On)
87rexlimivw 3137 . . . . . . . 8 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥) → 𝑦 ∈ On)
98abssi 4006 . . . . . . 7 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ⊆ On
10 limuni 6379 . . . . . . . . . . . 12 (Lim 𝐴𝐴 = 𝐴)
1110eqcomd 2746 . . . . . . . . . . 11 (Lim 𝐴 𝐴 = 𝐴)
12 fveq2 6834 . . . . . . . . . . . . . . 15 (𝑥 = 𝐴 → (card‘𝑥) = (card‘𝐴))
1312eqcomd 2746 . . . . . . . . . . . . . 14 (𝑥 = 𝐴 → (card‘𝐴) = (card‘𝑥))
1413biantrud 536 . . . . . . . . . . . . 13 (𝑥 = 𝐴 → ( 𝐴 = 𝐴 ↔ ( 𝐴 = 𝐴 ∧ (card‘𝐴) = (card‘𝑥))))
15 unieq 4856 . . . . . . . . . . . . . . . 16 (𝑥 = 𝐴 𝑥 = 𝐴)
1615eqeq1d 2742 . . . . . . . . . . . . . . 15 (𝑥 = 𝐴 → ( 𝑥 = 𝐴 𝐴 = 𝐴))
171pwid 4558 . . . . . . . . . . . . . . . . 17 𝐴 ∈ 𝒫 𝐴
18 eleq1 2828 . . . . . . . . . . . . . . . . 17 (𝑥 = 𝐴 → (𝑥 ∈ 𝒫 𝐴𝐴 ∈ 𝒫 𝐴))
1917, 18mpbiri 259 . . . . . . . . . . . . . . . 16 (𝑥 = 𝐴𝑥 ∈ 𝒫 𝐴)
2019biantrurd 537 . . . . . . . . . . . . . . 15 (𝑥 = 𝐴 → ( 𝑥 = 𝐴 ↔ (𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴)))
2116, 20bitr3d 282 . . . . . . . . . . . . . 14 (𝑥 = 𝐴 → ( 𝐴 = 𝐴 ↔ (𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴)))
2221anbi1d 637 . . . . . . . . . . . . 13 (𝑥 = 𝐴 → (( 𝐴 = 𝐴 ∧ (card‘𝐴) = (card‘𝑥)) ↔ ((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥))))
2314, 22bitr2d 281 . . . . . . . . . . . 12 (𝑥 = 𝐴 → (((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)) ↔ 𝐴 = 𝐴))
241, 23spcev 3551 . . . . . . . . . . 11 ( 𝐴 = 𝐴 → ∃𝑥((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
2511, 24syl 17 . . . . . . . . . 10 (Lim 𝐴 → ∃𝑥((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
26 df-rex 3065 . . . . . . . . . . 11 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)))
27 rabid 3413 . . . . . . . . . . . . 13 (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ↔ (𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴))
2827anbi1i 630 . . . . . . . . . . . 12 ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)) ↔ ((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
2928exbii 1855 . . . . . . . . . . 11 (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (card‘𝐴) = (card‘𝑥)) ↔ ∃𝑥((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
3026, 29bitri 276 . . . . . . . . . 10 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) ↔ ∃𝑥((𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴) ∧ (card‘𝐴) = (card‘𝑥)))
3125, 30sylibr 235 . . . . . . . . 9 (Lim 𝐴 → ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥))
32 fvex 6847 . . . . . . . . . 10 (card‘𝐴) ∈ V
33 eqeq1 2744 . . . . . . . . . . 11 (𝑦 = (card‘𝐴) → (𝑦 = (card‘𝑥) ↔ (card‘𝐴) = (card‘𝑥)))
3433rexbidv 3164 . . . . . . . . . 10 (𝑦 = (card‘𝐴) → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥)))
3532, 34spcev 3551 . . . . . . . . 9 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝐴) = (card‘𝑥) → ∃𝑦𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥))
3631, 35syl 17 . . . . . . . 8 (Lim 𝐴 → ∃𝑦𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥))
37 abn0 4320 . . . . . . . 8 ({𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅ ↔ ∃𝑦𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥))
3836, 37sylibr 235 . . . . . . 7 (Lim 𝐴 → {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅)
39 onint 7740 . . . . . . 7 (({𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ⊆ On ∧ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ≠ ∅) → {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
409, 38, 39sylancr 593 . . . . . 6 (Lim 𝐴 {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
414, 40eqeltrid 2844 . . . . 5 (Lim 𝐴 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (card‘𝑥) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
422, 41eqeltrd 2840 . . . 4 (Lim 𝐴 → (cf‘𝐴) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)})
43 fvex 6847 . . . . 5 (cf‘𝐴) ∈ V
44 eqeq1 2744 . . . . . 6 (𝑦 = (cf‘𝐴) → (𝑦 = (card‘𝑥) ↔ (cf‘𝐴) = (card‘𝑥)))
4544rexbidv 3164 . . . . 5 (𝑦 = (cf‘𝐴) → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥)))
4643, 45elab 3624 . . . 4 ((cf‘𝐴) ∈ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴}𝑦 = (card‘𝑥)} ↔ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥))
4742, 46sylib 219 . . 3 (Lim 𝐴 → ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥))
48 df-rex 3065 . . 3 (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} (cf‘𝐴) = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)))
4947, 48sylib 219 . 2 (Lim 𝐴 → ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)))
50 simprl 776 . . . . . . . 8 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴})
5150, 27sylib 219 . . . . . . 7 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴))
5251simpld 495 . . . . . 6 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ∈ 𝒫 𝐴)
5352elpwid 4545 . . . . 5 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥𝐴)
54 simpl 483 . . . . . . 7 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → Lim 𝐴)
55 vex 3436 . . . . . . . . . 10 𝑥 ∈ V
56 limord 6378 . . . . . . . . . . . 12 (Lim 𝐴 → Ord 𝐴)
57 ordsson 7733 . . . . . . . . . . . 12 (Ord 𝐴𝐴 ⊆ On)
5856, 57syl 17 . . . . . . . . . . 11 (Lim 𝐴𝐴 ⊆ On)
59 sstr 3930 . . . . . . . . . . 11 ((𝑥𝐴𝐴 ⊆ On) → 𝑥 ⊆ On)
6058, 59sylan2 599 . . . . . . . . . 10 ((𝑥𝐴 ∧ Lim 𝐴) → 𝑥 ⊆ On)
61 onssnum 9960 . . . . . . . . . 10 ((𝑥 ∈ V ∧ 𝑥 ⊆ On) → 𝑥 ∈ dom card)
6255, 60, 61sylancr 593 . . . . . . . . 9 ((𝑥𝐴 ∧ Lim 𝐴) → 𝑥 ∈ dom card)
63 cardid2 9875 . . . . . . . . 9 (𝑥 ∈ dom card → (card‘𝑥) ≈ 𝑥)
6462, 63syl 17 . . . . . . . 8 ((𝑥𝐴 ∧ Lim 𝐴) → (card‘𝑥) ≈ 𝑥)
6564ensymd 8949 . . . . . . 7 ((𝑥𝐴 ∧ Lim 𝐴) → 𝑥 ≈ (card‘𝑥))
6653, 54, 65syl2anc 590 . . . . . 6 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ≈ (card‘𝑥))
67 simprr 778 . . . . . 6 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (cf‘𝐴) = (card‘𝑥))
6866, 67breqtrrd 5107 . . . . 5 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 ≈ (cf‘𝐴))
6951simprd 496 . . . . 5 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → 𝑥 = 𝐴)
7053, 68, 693jca 1134 . . . 4 ((Lim 𝐴 ∧ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥))) → (𝑥𝐴𝑥 ≈ (cf‘𝐴) ∧ 𝑥 = 𝐴))
7170ex 413 . . 3 (Lim 𝐴 → ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)) → (𝑥𝐴𝑥 ≈ (cf‘𝐴) ∧ 𝑥 = 𝐴)))
7271eximdv 1924 . 2 (Lim 𝐴 → (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 𝑥 = 𝐴} ∧ (cf‘𝐴) = (card‘𝑥)) → ∃𝑥(𝑥𝐴𝑥 ≈ (cf‘𝐴) ∧ 𝑥 = 𝐴)))
7349, 72mpd 15 1 (Lim 𝐴 → ∃𝑥(𝑥𝐴𝑥 ≈ (cf‘𝐴) ∧ 𝑥 = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1092   = wceq 1547  wex 1786  wcel 2119  {cab 2718  wne 2935  wrex 3064  {crab 3392  Vcvv 3432  wss 3890  c0 4268  𝒫 cpw 4536   cuni 4845   cint 4884   ciin 4929   class class class wbr 5079  dom cdm 5625  Ord word 6316  Oncon0 6317  Lim wlim 6318  cfv 6492  cen 8887  cardccrd 9857  cfccf 9859
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-iun 4930  df-iin 4931  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7320  df-ov 7366  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-er 8640  df-en 8891  df-dom 8892  df-card 9861  df-cf 9863
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator