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

Theorem fival 8434
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 3316 . 2 (𝐴𝑉𝐴 ∈ V)
2 simpr 479 . . . . . . 7 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 = 𝑥)
3 inss1 3941 . . . . . . . . . 10 (𝒫 𝐴 ∩ Fin) ⊆ 𝒫 𝐴
43sseli 3705 . . . . . . . . 9 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥 ∈ 𝒫 𝐴)
54elpwid 4278 . . . . . . . 8 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥𝐴)
6 eqvisset 3315 . . . . . . . . 9 (𝑦 = 𝑥 𝑥 ∈ V)
7 intex 4925 . . . . . . . . 9 (𝑥 ≠ ∅ ↔ 𝑥 ∈ V)
86, 7sylibr 224 . . . . . . . 8 (𝑦 = 𝑥𝑥 ≠ ∅)
9 intssuni2 4610 . . . . . . . 8 ((𝑥𝐴𝑥 ≠ ∅) → 𝑥 𝐴)
105, 8, 9syl2an 495 . . . . . . 7 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑥 𝐴)
112, 10eqsstrd 3745 . . . . . 6 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 𝐴)
12 selpw 4273 . . . . . 6 (𝑦 ∈ 𝒫 𝐴𝑦 𝐴)
1311, 12sylibr 224 . . . . 5 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 ∈ 𝒫 𝐴)
1413rexlimiva 3130 . . . 4 (∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥𝑦 ∈ 𝒫 𝐴)
1514abssi 3783 . . 3 {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ⊆ 𝒫 𝐴
16 uniexg 7072 . . . 4 (𝐴𝑉 𝐴 ∈ V)
17 pwexg 4955 . . . 4 ( 𝐴 ∈ V → 𝒫 𝐴 ∈ V)
1816, 17syl 17 . . 3 (𝐴𝑉 → 𝒫 𝐴 ∈ V)
19 ssexg 4912 . . 3 (({𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ⊆ 𝒫 𝐴 ∧ 𝒫 𝐴 ∈ V) → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V)
2015, 18, 19sylancr 698 . 2 (𝐴𝑉 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V)
21 pweq 4269 . . . . . 6 (𝑧 = 𝐴 → 𝒫 𝑧 = 𝒫 𝐴)
2221ineq1d 3921 . . . . 5 (𝑧 = 𝐴 → (𝒫 𝑧 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
2322rexeqdv 3248 . . . 4 (𝑧 = 𝐴 → (∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥 ↔ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥))
2423abbidv 2843 . . 3 (𝑧 = 𝐴 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥} = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
25 df-fi 8433 . . 3 fi = (𝑧 ∈ V ↦ {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥})
2624, 25fvmptg 6394 . 2 ((𝐴 ∈ V ∧ {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V) → (fi‘𝐴) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
271, 20, 26syl2anc 696 1 (𝐴𝑉 → (fi‘𝐴) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1596  wcel 2103  {cab 2710  wne 2896  wrex 3015  Vcvv 3304  cin 3679  wss 3680  c0 4023  𝒫 cpw 4266   cuni 4544   cint 4583  cfv 6001  Fincfn 8072  ficfi 8432
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1835  ax-4 1850  ax-5 1952  ax-6 2018  ax-7 2054  ax-8 2105  ax-9 2112  ax-10 2132  ax-11 2147  ax-12 2160  ax-13 2355  ax-ext 2704  ax-sep 4889  ax-nul 4897  ax-pow 4948  ax-pr 5011  ax-un 7066
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1599  df-ex 1818  df-nf 1823  df-sb 2011  df-eu 2575  df-mo 2576  df-clab 2711  df-cleq 2717  df-clel 2720  df-nfc 2855  df-ne 2897  df-ral 3019  df-rex 3020  df-rab 3023  df-v 3306  df-sbc 3542  df-dif 3683  df-un 3685  df-in 3687  df-ss 3694  df-nul 4024  df-if 4195  df-pw 4268  df-sn 4286  df-pr 4288  df-op 4292  df-uni 4545  df-int 4584  df-br 4761  df-opab 4821  df-mpt 4838  df-id 5128  df-xp 5224  df-rel 5225  df-cnv 5226  df-co 5227  df-dm 5228  df-iota 5964  df-fun 6003  df-fv 6009  df-fi 8433
This theorem is referenced by:  elfi  8435  fi0  8442
  Copyright terms: Public domain W3C validator