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

Theorem fgval 23773
Description: The filter generating class gives a filter for every filter base. (Contributed by Jeff Hankins, 3-Sep-2009.) (Revised by Stefan O'Rear, 2-Aug-2015.)
Assertion
Ref Expression
fgval (𝐹 ∈ (fBas‘𝑋) → (𝑋filGen𝐹) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})
Distinct variable groups:   𝑥,𝐹   𝑥,𝑋

Proof of Theorem fgval
Dummy variables 𝑣 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-fg 21277 . . 3 filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅})
21a1i 11 . 2 (𝐹 ∈ (fBas‘𝑋) → filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅}))
3 pweq 4567 . . . . 5 (𝑣 = 𝑋 → 𝒫 𝑣 = 𝒫 𝑋)
43adantr 480 . . . 4 ((𝑣 = 𝑋𝑓 = 𝐹) → 𝒫 𝑣 = 𝒫 𝑋)
5 ineq1 4166 . . . . . 6 (𝑓 = 𝐹 → (𝑓 ∩ 𝒫 𝑥) = (𝐹 ∩ 𝒫 𝑥))
65neeq1d 2984 . . . . 5 (𝑓 = 𝐹 → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅))
76adantl 481 . . . 4 ((𝑣 = 𝑋𝑓 = 𝐹) → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅))
84, 7rabeqbidv 3415 . . 3 ((𝑣 = 𝑋𝑓 = 𝐹) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})
98adantl 481 . 2 ((𝐹 ∈ (fBas‘𝑋) ∧ (𝑣 = 𝑋𝑓 = 𝐹)) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})
10 fveq2 6826 . . 3 (𝑣 = 𝑋 → (fBas‘𝑣) = (fBas‘𝑋))
1110adantl 481 . 2 ((𝐹 ∈ (fBas‘𝑋) ∧ 𝑣 = 𝑋) → (fBas‘𝑣) = (fBas‘𝑋))
12 elfvex 6862 . 2 (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ V)
13 id 22 . 2 (𝐹 ∈ (fBas‘𝑋) → 𝐹 ∈ (fBas‘𝑋))
14 elfvdm 6861 . . 3 (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ dom fBas)
15 pwexg 5320 . . 3 (𝑋 ∈ dom fBas → 𝒫 𝑋 ∈ V)
16 rabexg 5279 . . 3 (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V)
1714, 15, 163syl 18 . 2 (𝐹 ∈ (fBas‘𝑋) → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V)
182, 9, 11, 12, 13, 17ovmpodx 7504 1 (𝐹 ∈ (fBas‘𝑋) → (𝑋filGen𝐹) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wne 2925  {crab 3396  Vcvv 3438  cin 3904  c0 4286  𝒫 cpw 4553  dom cdm 5623  cfv 6486  (class class class)co 7353  cmpo 7355  fBascfbas 21267  filGencfg 21268
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-iota 6442  df-fun 6488  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-fg 21277
This theorem is referenced by:  elfg  23774  restmetu  24474  neifg  36347
  Copyright terms: Public domain W3C validator