Theorem fgval 24182

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 21669	. . 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 3015	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅))
7	6	adantl 487	. . . 4 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅))
8	4, 7	rabeqbidv 3430	. . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})
9	8	adantl 487	. 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ (𝑣 = 𝑋 ∧ 𝑓 = 𝐹)) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})
10		fveq2 6883	. . 3 ⊢ (𝑣 = 𝑋 → (fBas‘𝑣) = (fBas‘𝑋))
11	10	adantl 487	. 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝑣 = 𝑋) → (fBas‘𝑣) = (fBas‘𝑋))
12		elfvex 6918	. 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ V)
13		id 23	. 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝐹 ∈ (fBas‘𝑋))
14		elfvdm 6917	. . 3 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ dom fBas)
15		pwexg 5340	. . 3 ⊢ (𝑋 ∈ dom fBas → 𝒫 𝑋 ∈ V)
16		rabexg 5299	. . 3 ⊢ (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V)
17	14, 15, 16	3syl 19	. 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V)
18	2, 9, 11, 12, 13, 17	ovmpodx 7569	1 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝑋filGen𝐹) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  {crab 3413  Vcvv 3451   ∩ cin 3898  ∅c0 4279  𝒫 cpw 4557  dom cdm 5651  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  fBascfbas 21659  filGencfg 21660

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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-fg 21669

This theorem is used by:  elfg  24183  restmetu  24882  neifg  37139