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

Theorem pwfir 9312
Description: If the power set of a set is finite, then the set itself is finite. (Contributed by BTernaryTau, 7-Sep-2024.)
Assertion
Ref Expression
pwfir (𝒫 𝐵 ∈ Fin → 𝐵 ∈ Fin)

Proof of Theorem pwfir
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ima 5663 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) = ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵)
2 relopab 5801 . . . . 5 Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
3 dmopabss 5899 . . . . 5 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ⊆ 𝒫 𝐵
4 relssres 6010 . . . . 5 ((Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ⊆ 𝒫 𝐵) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)})
52, 3, 4mp2an 705 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
65rneqi 5918 . . 3 ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵) = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
7 rnopab 5935 . . . 4 ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
8 eleq1 2848 . . . . . . . . 9 ({𝑦} = 𝑥 → ({𝑦} ∈ 𝒫 𝐵 ↔ 𝑥 ∈ 𝒫 𝐵))
98biimparc 485 . . . . . . . 8 ((𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) → {𝑦} ∈ 𝒫 𝐵)
10 vex 3454 . . . . . . . . 9 𝑦 ∈ V
1110snelpw 5412 . . . . . . . 8 (𝑦 ∈ 𝐵 ↔ {𝑦} ∈ 𝒫 𝐵)
129, 11sylibr 237 . . . . . . 7 ((𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) → 𝑦 ∈ 𝐵)
1312exlimiv 1962 . . . . . 6 (∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) → 𝑦 ∈ 𝐵)
14 snelpwi 5411 . . . . . . . 8 (𝑦 ∈ 𝐵 → {𝑦} ∈ 𝒫 𝐵)
15 eqid 2760 . . . . . . . 8 {𝑦} = {𝑦}
16 eqeq2 2772 . . . . . . . . 9 (𝑥 = {𝑦} → ({𝑦} = 𝑥 ↔ {𝑦} = {𝑦}))
1716rspcev 3576 . . . . . . . 8 (({𝑦} ∈ 𝒫 𝐵 ∧ {𝑦} = {𝑦}) → ∃𝑥 ∈ 𝒫 𝐵{𝑦} = 𝑥)
1814, 15, 17sylancl 598 . . . . . . 7 (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝒫 𝐵{𝑦} = 𝑥)
19 df-rex 3087 . . . . . . 7 (∃𝑥 ∈ 𝒫 𝐵{𝑦} = 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥))
2018, 19sylib 221 . . . . . 6 (𝑦 ∈ 𝐵 → ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥))
2113, 20impbii 212 . . . . 5 (∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) ↔ 𝑦 ∈ 𝐵)
2221abbii 2827 . . . 4 {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} = {𝑦 ∣ 𝑦 ∈ 𝐵}
23 abid2 2897 . . . 4 {𝑦 ∣ 𝑦 ∈ 𝐵} = 𝐵
247, 22, 233eqtri 2787 . . 3 ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} = 𝐵
251, 6, 243eqtri 2787 . 2 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) = 𝐵
26 funopab 6576 . . . 4 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥))
27 mosneq 4796 . . . . 5 ∃*𝑦{𝑦} = 𝑥
2827moani 2578 . . . 4 ∃*𝑦(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)
2926, 28mpgbir 1831 . . 3 Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
30 imafi 9311 . . 3 ((Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ∧ 𝒫 𝐵 ∈ Fin) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) ∈ Fin)
3129, 30mpan 703 . 2 (𝒫 𝐵 ∈ Fin → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) ∈ Fin)
3225, 31eqeltrrid 2865 1 (𝒫 𝐵 ∈ Fin → 𝐵 ∈ Fin)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃*wmo 2562  {cab 2738  ∃wrex 3086   ⊆ wss 3895  𝒫 cpw 4556  {csn 4584  {copab 5166  dom cdm 5650  ran crn 5651   ↾ cres 5652   “ cima 5653  Rel wrel 5655  Fun wfun 6533  Fincfn 8977
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-om 7879  df-1o 8480  df-en 8978  df-dom 8979  df-fin 8981
This theorem is used by:  pwfi  9314  hffi  9913
  Copyright terms: Public domain W3C validator