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

Theorem pwfir 9344
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 5669 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) = ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵)
2 relopab 5810 . . . . 5 Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
3 dmopabss 5910 . . . . 5 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ⊆ 𝒫 𝐵
4 relssres 6027 . . . . 5 ((Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ⊆ 𝒫 𝐵) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)})
52, 3, 4mp2an 705 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
65rneqi 5929 . . 3 ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↾ 𝒫 𝐵) = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
7 rnopab 5946 . . . 4 ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
8 eleq1 2852 . . . . . . . . 9 ({𝑦} = 𝑥 → ({𝑦} ∈ 𝒫 𝐵 ↔ 𝑥 ∈ 𝒫 𝐵))
98biimparc 485 . . . . . . . 8 ((𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) → {𝑦} ∈ 𝒫 𝐵)
10 vex 3458 . . . . . . . . 9 𝑦 ∈ V
1110snelpw 5418 . . . . . . . 8 (𝑦 ∈ 𝐵 ↔ {𝑦} ∈ 𝒫 𝐵)
129, 11sylibr 237 . . . . . . 7 ((𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) → 𝑦 ∈ 𝐵)
1312exlimiv 1965 . . . . . 6 (∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) → 𝑦 ∈ 𝐵)
14 snelpwi 5417 . . . . . . . 8 (𝑦 ∈ 𝐵 → {𝑦} ∈ 𝒫 𝐵)
15 eqid 2763 . . . . . . . 8 {𝑦} = {𝑦}
16 eqeq2 2775 . . . . . . . . 9 (𝑥 = {𝑦} → ({𝑦} = 𝑥 ↔ {𝑦} = {𝑦}))
1716rspcev 3580 . . . . . . . 8 (({𝑦} ∈ 𝒫 𝐵 ∧ {𝑦} = {𝑦}) → ∃𝑥 ∈ 𝒫 𝐵{𝑦} = 𝑥)
1814, 15, 17sylancl 598 . . . . . . 7 (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝒫 𝐵{𝑦} = 𝑥)
19 df-rex 3091 . . . . . . 7 (∃𝑥 ∈ 𝒫 𝐵{𝑦} = 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥))
2018, 19sylib 221 . . . . . 6 (𝑦 ∈ 𝐵 → ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥))
2113, 20impbii 212 . . . . 5 (∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥) ↔ 𝑦 ∈ 𝐵)
2221abbii 2830 . . . 4 {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} = {𝑦 ∣ 𝑦 ∈ 𝐵}
23 abid2 2901 . . . 4 {𝑦 ∣ 𝑦 ∈ 𝐵} = 𝐵
247, 22, 233eqtri 2790 . . 3 ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} = 𝐵
251, 6, 243eqtri 2790 . 2 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) = 𝐵
26 funopab 6601 . . . 4 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥))
27 mosneq 4800 . . . . 5 ∃*𝑦{𝑦} = 𝑥
2827moani 2581 . . . 4 ∃*𝑦(𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)
2926, 28mpgbir 1832 . . 3 Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)}
30 imafi 9343 . . 3 ((Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} ∧ 𝒫 𝐵 ∈ Fin) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) ∈ Fin)
3129, 30mpan 703 . 2 (𝒫 𝐵 ∈ Fin → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐵 ∧ {𝑦} = 𝑥)} “ 𝒫 𝐵) ∈ Fin)
3225, 31eqeltrrid 2869 1 (𝒫 𝐵 ∈ Fin → 𝐵 ∈ Fin)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃*wmo 2565  {cab 2741  ∃wrex 3090   ⊆ wss 3900  𝒫 cpw 4560  {csn 4588  {copab 5171  dom cdm 5656  ran crn 5657   ↾ cres 5658   “ cima 5659  Rel wrel 5661  Fun wfun 6558  Fincfn 9009
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7781
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-om 7910  df-1o 8512  df-en 9010  df-dom 9011  df-fin 9013
This theorem is used by:  pwfi  9346  hffi  9944
  Copyright terms: Public domain W3C validator