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

Theorem fival 8567
Description: The set of all the finite intersections of the elements of 𝐴. (Contributed by FL, 27-Apr-2008.) (Revised by Mario Carneiro, 24-Nov-2013.)
Assertion
Ref Expression
fival (𝐴𝑉 → (fi‘𝐴) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝑉
Allowed substitution hint:   𝑉(𝑦)

Proof of Theorem fival
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 elex 3417 . 2 (𝐴𝑉𝐴 ∈ V)
2 simpr 473 . . . . . . 7 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 = 𝑥)
3 inss1 4040 . . . . . . . . . 10 (𝒫 𝐴 ∩ Fin) ⊆ 𝒫 𝐴
43sseli 3805 . . . . . . . . 9 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥 ∈ 𝒫 𝐴)
54elpwid 4374 . . . . . . . 8 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥𝐴)
6 eqvisset 3416 . . . . . . . . 9 (𝑦 = 𝑥 𝑥 ∈ V)
7 intex 5025 . . . . . . . . 9 (𝑥 ≠ ∅ ↔ 𝑥 ∈ V)
86, 7sylibr 225 . . . . . . . 8 (𝑦 = 𝑥𝑥 ≠ ∅)
9 intssuni2 4705 . . . . . . . 8 ((𝑥𝐴𝑥 ≠ ∅) → 𝑥 𝐴)
105, 8, 9syl2an 585 . . . . . . 7 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑥 𝐴)
112, 10eqsstrd 3847 . . . . . 6 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 𝐴)
12 selpw 4369 . . . . . 6 (𝑦 ∈ 𝒫 𝐴𝑦 𝐴)
1311, 12sylibr 225 . . . . 5 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 ∈ 𝒫 𝐴)
1413rexlimiva 3227 . . . 4 (∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥𝑦 ∈ 𝒫 𝐴)
1514abssi 3885 . . 3 {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ⊆ 𝒫 𝐴
16 uniexg 7195 . . . 4 (𝐴𝑉 𝐴 ∈ V)
1716pwexd 5062 . . 3 (𝐴𝑉 → 𝒫 𝐴 ∈ V)
18 ssexg 5012 . . 3 (({𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ⊆ 𝒫 𝐴 ∧ 𝒫 𝐴 ∈ V) → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V)
1915, 17, 18sylancr 577 . 2 (𝐴𝑉 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V)
20 pweq 4365 . . . . . 6 (𝑧 = 𝐴 → 𝒫 𝑧 = 𝒫 𝐴)
2120ineq1d 4023 . . . . 5 (𝑧 = 𝐴 → (𝒫 𝑧 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
2221rexeqdv 3345 . . . 4 (𝑧 = 𝐴 → (∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥 ↔ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥))
2322abbidv 2936 . . 3 (𝑧 = 𝐴 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥} = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
24 df-fi 8566 . . 3 fi = (𝑧 ∈ V ↦ {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥})
2523, 24fvmptg 6511 . 2 ((𝐴 ∈ V ∧ {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V) → (fi‘𝐴) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
261, 19, 25syl2anc 575 1 (𝐴𝑉 → (fi‘𝐴) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1637  wcel 2157  {cab 2803  wne 2989  wrex 3108  Vcvv 3402  cin 3779  wss 3780  c0 4127  𝒫 cpw 4362   cuni 4641   cint 4680  cfv 6111  Fincfn 8202  ficfi 8565
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2069  ax-7 2105  ax-8 2159  ax-9 2166  ax-10 2186  ax-11 2202  ax-12 2215  ax-13 2422  ax-ext 2795  ax-sep 4988  ax-nul 4996  ax-pow 5048  ax-pr 5109  ax-un 7189
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2062  df-mo 2635  df-eu 2642  df-clab 2804  df-cleq 2810  df-clel 2813  df-nfc 2948  df-ne 2990  df-ral 3112  df-rex 3113  df-rab 3116  df-v 3404  df-sbc 3645  df-dif 3783  df-un 3785  df-in 3787  df-ss 3794  df-nul 4128  df-if 4291  df-pw 4364  df-sn 4382  df-pr 4384  df-op 4388  df-uni 4642  df-int 4681  df-br 4856  df-opab 4918  df-mpt 4935  df-id 5232  df-xp 5330  df-rel 5331  df-cnv 5332  df-co 5333  df-dm 5334  df-iota 6074  df-fun 6113  df-fv 6119  df-fi 8566
This theorem is referenced by:  elfi  8568  fi0  8575
  Copyright terms: Public domain W3C validator