Theorem fgval 24096

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.

Step	Hyp	Ref	Expression
1		df-fg 21583	. . 3 ⊢ filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅})
2	1	a1i 11	. 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅}))
3		pweq 4571	. . . . 5 ⊢ (𝑣 = 𝑋 → 𝒫 𝑣 = 𝒫 𝑋)
4	3	adantr 486	. . . 4 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → 𝒫 𝑣 = 𝒫 𝑋)
5		ineq1 4159	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓 ∩ 𝒫 𝑥) = (𝐹 ∩ 𝒫 𝑥))
6	5	neeq1d 3014	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅))
7	6	adantl 487	. . . 4 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅))
8	4, 7	rabeqbidv 3429	. . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})
9	8	adantl 487	. 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ (𝑣 = 𝑋 ∧ 𝑓 = 𝐹)) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})
10		fveq2 6878	. . 3 ⊢ (𝑣 = 𝑋 → (fBas‘𝑣) = (fBas‘𝑋))
11	10	adantl 487	. 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝑣 = 𝑋) → (fBas‘𝑣) = (fBas‘𝑋))
12		elfvex 6913	. 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ V)
13		id 23	. 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝐹 ∈ (fBas‘𝑋))
14		elfvdm 6912	. . 3 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ dom fBas)
15		pwexg 5343	. . 3 ⊢ (𝑋 ∈ dom fBas → 𝒫 𝑋 ∈ V)
16		rabexg 5302	. . 3 ⊢ (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V)
17	14, 15, 16	3syl 19	. 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V)
18	2, 9, 11, 12, 13, 17	ovmpodx 7564	1 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝑋filGen𝐹) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  {crab 3412  Vcvv 3450   ∩ cin 3898  ∅c0 4279  𝒫 cpw 4557  dom cdm 5655  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  fBascfbas 21573  filGencfg 21574

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-fg 21583

This theorem is used by:  elfg  24097  restmetu  24796  neifg  36990