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

Theorem cf0 10164
Description: Value of the cofinality function at 0. Exercise 2 of [TakeutiZaring] p. 102. (Contributed by NM, 16-Apr-2004.)
Assertion
Ref Expression
cf0 (cf‘∅) = ∅

Proof of Theorem cf0
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cfub 10162 . . 3 (cf‘∅) ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦))}
2 0ss 4341 . . . . . . . . . . . 12 ∅ ⊆ 𝑦
32biantru 529 . . . . . . . . . . 11 (𝑦 ⊆ ∅ ↔ (𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦))
4 ss0b 4342 . . . . . . . . . . 11 (𝑦 ⊆ ∅ ↔ 𝑦 = ∅)
53, 4bitr3i 277 . . . . . . . . . 10 ((𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦) ↔ 𝑦 = ∅)
65anbi1ci 627 . . . . . . . . 9 ((𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦)) ↔ (𝑦 = ∅ ∧ 𝑥 = (card‘𝑦)))
76exbii 1850 . . . . . . . 8 (∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦)) ↔ ∃𝑦(𝑦 = ∅ ∧ 𝑥 = (card‘𝑦)))
8 0ex 5242 . . . . . . . . 9 ∅ ∈ V
9 fveq2 6834 . . . . . . . . . 10 (𝑦 = ∅ → (card‘𝑦) = (card‘∅))
109eqeq2d 2748 . . . . . . . . 9 (𝑦 = ∅ → (𝑥 = (card‘𝑦) ↔ 𝑥 = (card‘∅)))
118, 10ceqsexv 3479 . . . . . . . 8 (∃𝑦(𝑦 = ∅ ∧ 𝑥 = (card‘𝑦)) ↔ 𝑥 = (card‘∅))
12 card0 9873 . . . . . . . . 9 (card‘∅) = ∅
1312eqeq2i 2750 . . . . . . . 8 (𝑥 = (card‘∅) ↔ 𝑥 = ∅)
147, 11, 133bitri 297 . . . . . . 7 (∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦)) ↔ 𝑥 = ∅)
1514abbii 2804 . . . . . 6 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦))} = {𝑥𝑥 = ∅}
16 df-sn 4569 . . . . . 6 {∅} = {𝑥𝑥 = ∅}
1715, 16eqtr4i 2763 . . . . 5 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦))} = {∅}
1817inteqi 4894 . . . 4 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦))} = {∅}
198intsn 4927 . . . 4 {∅} = ∅
2018, 19eqtri 2760 . . 3 {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ ∅ ∧ ∅ ⊆ 𝑦))} = ∅
211, 20sseqtri 3971 . 2 (cf‘∅) ⊆ ∅
22 ss0b 4342 . 2 ((cf‘∅) ⊆ ∅ ↔ (cf‘∅) = ∅)
2321, 22mpbi 230 1 (cf‘∅) = ∅
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1542  wex 1781  {cab 2715  wss 3890  c0 4274  {csn 4568   cuni 4851   cint 4890  cfv 6492  cardccrd 9850  cfccf 9852
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-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
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-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  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-en 8887  df-card 9854  df-cf 9856
This theorem is referenced by:  cfeq0  10169  cflim2  10176  cfidm  10188  alephsing  10189  alephreg  10496  pwcfsdom  10497  rankcf  10691
  Copyright terms: Public domain W3C validator