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

Theorem pwfilem 8301
Description: Lemma for pwfi 8302. (Contributed by NM, 26-Mar-2007.)
Hypothesis
Ref Expression
pwfilem.1 𝐹 = (𝑐 ∈ 𝒫 𝑏 ↦ (𝑐 ∪ {𝑥}))
Assertion
Ref Expression
pwfilem (𝒫 𝑏 ∈ Fin → 𝒫 (𝑏 ∪ {𝑥}) ∈ Fin)
Distinct variable groups:   𝑏,𝑐   𝑥,𝑐
Allowed substitution hints:   𝐹(𝑥,𝑏,𝑐)

Proof of Theorem pwfilem
Dummy variable 𝑑 is distinct from all other variables.
StepHypRef Expression
1 pwundif 5050 . 2 𝒫 (𝑏 ∪ {𝑥}) = ((𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ∪ 𝒫 𝑏)
2 vex 3234 . . . . . . . . 9 𝑐 ∈ V
3 snex 4938 . . . . . . . . 9 {𝑥} ∈ V
42, 3unex 6998 . . . . . . . 8 (𝑐 ∪ {𝑥}) ∈ V
5 pwfilem.1 . . . . . . . 8 𝐹 = (𝑐 ∈ 𝒫 𝑏 ↦ (𝑐 ∪ {𝑥}))
64, 5fnmpti 6060 . . . . . . 7 𝐹 Fn 𝒫 𝑏
7 dffn4 6159 . . . . . . 7 (𝐹 Fn 𝒫 𝑏𝐹:𝒫 𝑏onto→ran 𝐹)
86, 7mpbi 220 . . . . . 6 𝐹:𝒫 𝑏onto→ran 𝐹
9 fodomfi 8280 . . . . . 6 ((𝒫 𝑏 ∈ Fin ∧ 𝐹:𝒫 𝑏onto→ran 𝐹) → ran 𝐹 ≼ 𝒫 𝑏)
108, 9mpan2 707 . . . . 5 (𝒫 𝑏 ∈ Fin → ran 𝐹 ≼ 𝒫 𝑏)
11 domfi 8222 . . . . 5 ((𝒫 𝑏 ∈ Fin ∧ ran 𝐹 ≼ 𝒫 𝑏) → ran 𝐹 ∈ Fin)
1210, 11mpdan 703 . . . 4 (𝒫 𝑏 ∈ Fin → ran 𝐹 ∈ Fin)
13 eldifi 3765 . . . . . . . . 9 (𝑑 ∈ (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) → 𝑑 ∈ 𝒫 (𝑏 ∪ {𝑥}))
143elpwun 7019 . . . . . . . . 9 (𝑑 ∈ 𝒫 (𝑏 ∪ {𝑥}) ↔ (𝑑 ∖ {𝑥}) ∈ 𝒫 𝑏)
1513, 14sylib 208 . . . . . . . 8 (𝑑 ∈ (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) → (𝑑 ∖ {𝑥}) ∈ 𝒫 𝑏)
16 undif1 4076 . . . . . . . . 9 ((𝑑 ∖ {𝑥}) ∪ {𝑥}) = (𝑑 ∪ {𝑥})
17 elpwunsn 4256 . . . . . . . . . . 11 (𝑑 ∈ (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) → 𝑥𝑑)
1817snssd 4372 . . . . . . . . . 10 (𝑑 ∈ (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) → {𝑥} ⊆ 𝑑)
19 ssequn2 3819 . . . . . . . . . 10 ({𝑥} ⊆ 𝑑 ↔ (𝑑 ∪ {𝑥}) = 𝑑)
2018, 19sylib 208 . . . . . . . . 9 (𝑑 ∈ (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) → (𝑑 ∪ {𝑥}) = 𝑑)
2116, 20syl5req 2698 . . . . . . . 8 (𝑑 ∈ (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) → 𝑑 = ((𝑑 ∖ {𝑥}) ∪ {𝑥}))
22 uneq1 3793 . . . . . . . . . 10 (𝑐 = (𝑑 ∖ {𝑥}) → (𝑐 ∪ {𝑥}) = ((𝑑 ∖ {𝑥}) ∪ {𝑥}))
2322eqeq2d 2661 . . . . . . . . 9 (𝑐 = (𝑑 ∖ {𝑥}) → (𝑑 = (𝑐 ∪ {𝑥}) ↔ 𝑑 = ((𝑑 ∖ {𝑥}) ∪ {𝑥})))
2423rspcev 3340 . . . . . . . 8 (((𝑑 ∖ {𝑥}) ∈ 𝒫 𝑏𝑑 = ((𝑑 ∖ {𝑥}) ∪ {𝑥})) → ∃𝑐 ∈ 𝒫 𝑏𝑑 = (𝑐 ∪ {𝑥}))
2515, 21, 24syl2anc 694 . . . . . . 7 (𝑑 ∈ (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) → ∃𝑐 ∈ 𝒫 𝑏𝑑 = (𝑐 ∪ {𝑥}))
265, 4elrnmpti 5408 . . . . . . 7 (𝑑 ∈ ran 𝐹 ↔ ∃𝑐 ∈ 𝒫 𝑏𝑑 = (𝑐 ∪ {𝑥}))
2725, 26sylibr 224 . . . . . 6 (𝑑 ∈ (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) → 𝑑 ∈ ran 𝐹)
2827ssriv 3640 . . . . 5 (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ⊆ ran 𝐹
29 ssdomg 8043 . . . . 5 (ran 𝐹 ∈ Fin → ((𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ⊆ ran 𝐹 → (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ≼ ran 𝐹))
3012, 28, 29mpisyl 21 . . . 4 (𝒫 𝑏 ∈ Fin → (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ≼ ran 𝐹)
31 domfi 8222 . . . 4 ((ran 𝐹 ∈ Fin ∧ (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ≼ ran 𝐹) → (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ∈ Fin)
3212, 30, 31syl2anc 694 . . 3 (𝒫 𝑏 ∈ Fin → (𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ∈ Fin)
33 unfi 8268 . . 3 (((𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ∈ Fin ∧ 𝒫 𝑏 ∈ Fin) → ((𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ∪ 𝒫 𝑏) ∈ Fin)
3432, 33mpancom 704 . 2 (𝒫 𝑏 ∈ Fin → ((𝒫 (𝑏 ∪ {𝑥}) ∖ 𝒫 𝑏) ∪ 𝒫 𝑏) ∈ Fin)
351, 34syl5eqel 2734 1 (𝒫 𝑏 ∈ Fin → 𝒫 (𝑏 ∪ {𝑥}) ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1523  wcel 2030  wrex 2942  cdif 3604  cun 3605  wss 3607  𝒫 cpw 4191  {csn 4210   class class class wbr 4685  cmpt 4762  ran crn 5144   Fn wfn 5921  ontowfo 5924  cdom 7995  Fincfn 7997
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-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-oadd 7609  df-er 7787  df-en 7998  df-dom 7999  df-fin 8001
This theorem is referenced by:  pwfi  8302
  Copyright terms: Public domain W3C validator