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

Theorem pwfir 9301
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 5664 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) = ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵)
2 relopab 5802 . . . . 5 Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
3 dmopabss 5900 . . . . 5 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ⊆ 𝒫 𝐵
4 relssres 6011 . . . . 5 ((Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ⊆ 𝒫 𝐵) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)})
52, 3, 4mp2an 705 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
65rneqi 5919 . . 3 ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵) = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
7 rnopab 5936 . . . 4 ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
8 eleq1 2849 . . . . . . . . 9 ({𝑦} = 𝑥 → ({𝑦} ∈ 𝒫 𝐵 ↔ 𝑥 ∈ 𝒫 𝐵))
98biimparc 485 . . . . . . . 8 ((𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) → {𝑦} ∈ 𝒫 𝐵)
10 vex 3455 . . . . . . . . 9 𝑦 ∈ V
1110snelpw 5413 . . . . . . . 8 (𝑦 ∈ 𝐵 ↔ {𝑦} ∈ 𝒫 𝐵)
129, 11sylibr 237 . . . . . . 7 ((𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) → 𝑦 ∈ 𝐵)
1312exlimiv 1963 . . . . . 6 (∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) → 𝑦 ∈ 𝐵)
14 snelpwi 5412 . . . . . . . 8 (𝑦 ∈ 𝐵 → {𝑦} ∈ 𝒫 𝐵)
15 eqid 2761 . . . . . . . 8 {𝑦} = {𝑦}
16 eqeq2 2773 . . . . . . . . 9 (𝑥 = {𝑦} → ({𝑦} = 𝑥 ↔ {𝑦} = {𝑦}))
1716rspcev 3577 . . . . . . . 8 (({𝑦} ∈ 𝒫 𝐵 ∧ {𝑦} = {𝑦}) → ∃𝑥 ∈ 𝒫 𝐵{𝑦} = 𝑥)
1814, 15, 17sylancl 598 . . . . . . 7 (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝒫 𝐵{𝑦} = 𝑥)
19 df-rex 3088 . . . . . . 7 (∃𝑥 ∈ 𝒫 𝐵{𝑦} = 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥))
2018, 19sylib 221 . . . . . 6 (𝑦 ∈ 𝐵 → ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥))
2113, 20impbii 212 . . . . 5 (∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) ↔ 𝑦 ∈ 𝐵)
2221abbii 2828 . . . 4 {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} = {𝑦 ∣ 𝑦 ∈ 𝐵}
23 abid2 2898 . . . 4 {𝑦 ∣ 𝑦 ∈ 𝐵} = 𝐵
247, 22, 233eqtri 2788 . . 3 ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} = 𝐵
251, 6, 243eqtri 2788 . 2 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) = 𝐵
26 funopab 6573 . . . 4 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥))
27 mosneq 4802 . . . . 5 ∃*𝑦{𝑦} = 𝑥
2827moani 2579 . . . 4 ∃*𝑦(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)
2926, 28mpgbir 1832 . . 3 Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
30 imafi 9300 . . 3 ((Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ∧ 𝒫 𝐵 ∈ Fin) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) ∈ Fin)
3129, 30mpan 703 . 2 (𝒫 𝐵 ∈ Fin → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) ∈ Fin)
3225, 31eqeltrrid 2866 1 (𝒫 𝐵 ∈ Fin → 𝐵 ∈ Fin)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃*wmo 2563  {cab 2739  ∃wrex 3087   ⊆ wss 3899  𝒫 cpw 4557  {csn 4584  {copab 5167  dom cdm 5651  ran crn 5652   ↾ cres 5653   “ cima 5654  Rel wrel 5656  Fun wfun 6531  Fincfn 8966
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-om 7876  df-1o 8469  df-en 8967  df-dom 8968  df-fin 8970
This theorem is used by:  pwfi  9303  hffi  9902
  Copyright terms: Public domain W3C validator