ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fival GIF version

Theorem fival 7294
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 df-fi 7293 . 2 fi = (𝑧 ∈ V ↦ {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥})
2 pweq 3688 . . . . 5 (𝑧 = 𝐴 → 𝒫 𝑧 = 𝒫 𝐴)
32ineq1d 3431 . . . 4 (𝑧 = 𝐴 → (𝒫 𝑧 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
43rexeqdv 2756 . . 3 (𝑧 = 𝐴 → (∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥 ↔ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥))
54abbidv 2358 . 2 (𝑧 = 𝐴 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥} = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
6 elex 2833 . 2 (𝐴𝑉𝐴 ∈ V)
7 simpr 110 . . . . . . 7 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 = 𝑥)
8 elinel1 3415 . . . . . . . . 9 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥 ∈ 𝒫 𝐴)
98elpwid 3696 . . . . . . . 8 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥𝐴)
10 eqvisset 2832 . . . . . . . . . . . 12 (𝑦 = 𝑥 𝑥 ∈ V)
11 intexr 4281 . . . . . . . . . . . 12 ( 𝑥 ∈ V → 𝑥 ≠ ∅)
1210, 11syl 14 . . . . . . . . . . 11 (𝑦 = 𝑥𝑥 ≠ ∅)
1312adantl 277 . . . . . . . . . 10 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑥 ≠ ∅)
1413neneqd 2441 . . . . . . . . 9 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → ¬ 𝑥 = ∅)
15 elinel2 3416 . . . . . . . . . . 11 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥 ∈ Fin)
1615adantr 276 . . . . . . . . . 10 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑥 ∈ Fin)
17 fin0or 7180 . . . . . . . . . . 11 (𝑥 ∈ Fin → (𝑥 = ∅ ∨ ∃𝑧 𝑧𝑥))
1817orcomd 741 . . . . . . . . . 10 (𝑥 ∈ Fin → (∃𝑧 𝑧𝑥𝑥 = ∅))
1916, 18syl 14 . . . . . . . . 9 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → (∃𝑧 𝑧𝑥𝑥 = ∅))
2014, 19ecased 1390 . . . . . . . 8 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → ∃𝑧 𝑧𝑥)
21 intssuni2m 3989 . . . . . . . 8 ((𝑥𝐴 ∧ ∃𝑧 𝑧𝑥) → 𝑥 𝐴)
229, 20, 21syl2an2r 603 . . . . . . 7 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑥 𝐴)
237, 22eqsstrd 3284 . . . . . 6 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 𝐴)
24 velpw 3692 . . . . . 6 (𝑦 ∈ 𝒫 𝐴𝑦 𝐴)
2523, 24sylibr 134 . . . . 5 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 ∈ 𝒫 𝐴)
2625rexlimiva 2663 . . . 4 (∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥𝑦 ∈ 𝒫 𝐴)
2726abssi 3323 . . 3 {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ⊆ 𝒫 𝐴
28 uniexg 4580 . . . 4 (𝐴𝑉 𝐴 ∈ V)
2928pwexd 4313 . . 3 (𝐴𝑉 → 𝒫 𝐴 ∈ V)
30 ssexg 4267 . . 3 (({𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ⊆ 𝒫 𝐴 ∧ 𝒫 𝐴 ∈ V) → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V)
3127, 29, 30sylancr 418 . 2 (𝐴𝑉 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V)
321, 5, 6, 31fvmptd3 5793 1 (𝐴𝑉 → (fi‘𝐴) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 720   = wceq 1402  wex 1545  wcel 2209  {cab 2224  wne 2420  wrex 2529  Vcvv 2821  cin 3219  wss 3220  c0 3520  𝒫 cpw 3685   cuni 3930   cint 3965  cfv 5372  Fincfn 7012  ficfi 7292
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-13 2211  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-er 6797  df-en 7013  df-fin 7015  df-fi 7293
This theorem is referenced by:  elfi  7295  fi0  7299
  Copyright terms: Public domain W3C validator