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

Theorem cflem 9106
 Description: A lemma used to simplify cofinality computations, showing the existence of the cardinal of an unbounded subset of a set 𝐴. (Contributed by NM, 24-Apr-2004.)
Assertion
Ref Expression
cflem (𝐴𝑉 → ∃𝑥𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)))
Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝐴
Allowed substitution hints:   𝑉(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem cflem
StepHypRef Expression
1 ssid 3657 . . 3 𝐴𝐴
2 ssid 3657 . . . . 5 𝑧𝑧
3 sseq2 3660 . . . . . 6 (𝑤 = 𝑧 → (𝑧𝑤𝑧𝑧))
43rspcev 3340 . . . . 5 ((𝑧𝐴𝑧𝑧) → ∃𝑤𝐴 𝑧𝑤)
52, 4mpan2 707 . . . 4 (𝑧𝐴 → ∃𝑤𝐴 𝑧𝑤)
65rgen 2951 . . 3 𝑧𝐴𝑤𝐴 𝑧𝑤
7 sseq1 3659 . . . . 5 (𝑦 = 𝐴 → (𝑦𝐴𝐴𝐴))
8 rexeq 3169 . . . . . 6 (𝑦 = 𝐴 → (∃𝑤𝑦 𝑧𝑤 ↔ ∃𝑤𝐴 𝑧𝑤))
98ralbidv 3015 . . . . 5 (𝑦 = 𝐴 → (∀𝑧𝐴𝑤𝑦 𝑧𝑤 ↔ ∀𝑧𝐴𝑤𝐴 𝑧𝑤))
107, 9anbi12d 747 . . . 4 (𝑦 = 𝐴 → ((𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤) ↔ (𝐴𝐴 ∧ ∀𝑧𝐴𝑤𝐴 𝑧𝑤)))
1110spcegv 3325 . . 3 (𝐴𝑉 → ((𝐴𝐴 ∧ ∀𝑧𝐴𝑤𝐴 𝑧𝑤) → ∃𝑦(𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)))
121, 6, 11mp2ani 714 . 2 (𝐴𝑉 → ∃𝑦(𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))
13 fvex 6239 . . . . . 6 (card‘𝑦) ∈ V
1413isseti 3240 . . . . 5 𝑥 𝑥 = (card‘𝑦)
15 19.41v 1917 . . . . 5 (∃𝑥(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) ↔ (∃𝑥 𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)))
1614, 15mpbiran 973 . . . 4 (∃𝑥(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) ↔ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))
1716exbii 1814 . . 3 (∃𝑦𝑥(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) ↔ ∃𝑦(𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤))
18 excom 2082 . . 3 (∃𝑦𝑥(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)) ↔ ∃𝑥𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)))
1917, 18bitr3i 266 . 2 (∃𝑦(𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤) ↔ ∃𝑥𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)))
2012, 19sylib 208 1 (𝐴𝑉 → ∃𝑥𝑦(𝑥 = (card‘𝑦) ∧ (𝑦𝐴 ∧ ∀𝑧𝐴𝑤𝑦 𝑧𝑤)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1523  ∃wex 1744   ∈ wcel 2030  ∀wral 2941  ∃wrex 2942   ⊆ wss 3607  ‘cfv 5926  cardccrd 8799 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-nul 4822 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-sn 4211  df-pr 4213  df-uni 4469  df-iota 5889  df-fv 5934 This theorem is referenced by:  cfval  9107  cff  9108  cff1  9118
 Copyright terms: Public domain W3C validator