| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fgval | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| fgval | ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝑋filGen𝐹) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-fg 21520 | . . 3 ⊢ filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅}) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅})) |
| 3 | pweq 4576 | . . . . 5 ⊢ (𝑣 = 𝑋 → 𝒫 𝑣 = 𝒫 𝑋) | |
| 4 | 3 | adantr 485 | . . . 4 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → 𝒫 𝑣 = 𝒫 𝑋) |
| 5 | ineq1 4166 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓 ∩ 𝒫 𝑥) = (𝐹 ∩ 𝒫 𝑥)) | |
| 6 | 5 | neeq1d 3017 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅)) |
| 7 | 6 | adantl 486 | . . . 4 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅)) |
| 8 | 4, 7 | rabeqbidv 3434 | . . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| 9 | 8 | adantl 486 | . 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ (𝑣 = 𝑋 ∧ 𝑓 = 𝐹)) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| 10 | fveq2 6881 | . . 3 ⊢ (𝑣 = 𝑋 → (fBas‘𝑣) = (fBas‘𝑋)) | |
| 11 | 10 | adantl 486 | . 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝑣 = 𝑋) → (fBas‘𝑣) = (fBas‘𝑋)) |
| 12 | elfvex 6916 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ V) | |
| 13 | id 23 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 14 | elfvdm 6915 | . . 3 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ dom fBas) | |
| 15 | pwexg 5349 | . . 3 ⊢ (𝑋 ∈ dom fBas → 𝒫 𝑋 ∈ V) | |
| 16 | rabexg 5308 | . . 3 ⊢ (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V) | |
| 17 | 14, 15, 16 | 3syl 19 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V) |
| 18 | 2, 9, 11, 12, 13, 17 | ovmpodx 7561 | 1 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝑋filGen𝐹) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 {crab 3416 Vcvv 3455 ∩ cin 3904 ∅c0 4286 𝒫 cpw 4562 dom cdm 5661 ‘cfv 6536 (class class class)co 7410 ∈ cmpo 7412 fBascfbas 21510 filGencfg 21511 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-iota 6492 df-fun 6538 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-fg 21520 |
| This theorem is referenced by: elfg 24028 restmetu 24727 neifg 36882 |
| Copyright terms: Public domain | W3C validator |