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

Theorem fival 7160
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 7159 . 2 fi = (𝑧 ∈ V ↦ {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥})
2 pweq 3653 . . . . 5 (𝑧 = 𝐴 → 𝒫 𝑧 = 𝒫 𝐴)
32ineq1d 3405 . . . 4 (𝑧 = 𝐴 → (𝒫 𝑧 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
43rexeqdv 2735 . . 3 (𝑧 = 𝐴 → (∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥 ↔ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥))
54abbidv 2347 . 2 (𝑧 = 𝐴 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = 𝑥} = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
6 elex 2812 . 2 (𝐴𝑉𝐴 ∈ V)
7 simpr 110 . . . . . . 7 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 = 𝑥)
8 elinel1 3391 . . . . . . . . 9 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥 ∈ 𝒫 𝐴)
98elpwid 3661 . . . . . . . 8 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥𝐴)
10 eqvisset 2811 . . . . . . . . . . . 12 (𝑦 = 𝑥 𝑥 ∈ V)
11 intexr 4238 . . . . . . . . . . . 12 ( 𝑥 ∈ V → 𝑥 ≠ ∅)
1210, 11syl 14 . . . . . . . . . . 11 (𝑦 = 𝑥𝑥 ≠ ∅)
1312adantl 277 . . . . . . . . . 10 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑥 ≠ ∅)
1413neneqd 2421 . . . . . . . . 9 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → ¬ 𝑥 = ∅)
15 elinel2 3392 . . . . . . . . . . 11 (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥 ∈ Fin)
1615adantr 276 . . . . . . . . . 10 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑥 ∈ Fin)
17 fin0or 7068 . . . . . . . . . . 11 (𝑥 ∈ Fin → (𝑥 = ∅ ∨ ∃𝑧 𝑧𝑥))
1817orcomd 734 . . . . . . . . . 10 (𝑥 ∈ Fin → (∃𝑧 𝑧𝑥𝑥 = ∅))
1916, 18syl 14 . . . . . . . . 9 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → (∃𝑧 𝑧𝑥𝑥 = ∅))
2014, 19ecased 1383 . . . . . . . 8 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → ∃𝑧 𝑧𝑥)
21 intssuni2m 3950 . . . . . . . 8 ((𝑥𝐴 ∧ ∃𝑧 𝑧𝑥) → 𝑥 𝐴)
229, 20, 21syl2an2r 597 . . . . . . 7 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑥 𝐴)
237, 22eqsstrd 3261 . . . . . 6 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 𝐴)
24 velpw 3657 . . . . . 6 (𝑦 ∈ 𝒫 𝐴𝑦 𝐴)
2523, 24sylibr 134 . . . . 5 ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 ∈ 𝒫 𝐴)
2625rexlimiva 2643 . . . 4 (∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥𝑦 ∈ 𝒫 𝐴)
2726abssi 3300 . . 3 {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ⊆ 𝒫 𝐴
28 uniexg 4534 . . . 4 (𝐴𝑉 𝐴 ∈ V)
2928pwexd 4269 . . 3 (𝐴𝑉 → 𝒫 𝐴 ∈ V)
30 ssexg 4226 . . 3 (({𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ⊆ 𝒫 𝐴 ∧ 𝒫 𝐴 ∈ V) → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V)
3127, 29, 30sylancr 414 . 2 (𝐴𝑉 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥} ∈ V)
321, 5, 6, 31fvmptd3 5736 1 (𝐴𝑉 → (fi‘𝐴) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = 𝑥})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 713   = wceq 1395  wex 1538  wcel 2200  {cab 2215  wne 2400  wrex 2509  Vcvv 2800  cin 3197  wss 3198  c0 3492  𝒫 cpw 3650   cuni 3891   cint 3926  cfv 5324  Fincfn 6904  ficfi 7158
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-er 6697  df-en 6905  df-fin 6907  df-fi 7159
This theorem is referenced by:  elfi  7161  fi0  7165
  Copyright terms: Public domain W3C validator