| 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 21319 | . . 3 ⊢ filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅}) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅})) |
| 3 | pweq 4570 | . . . . 5 ⊢ (𝑣 = 𝑋 → 𝒫 𝑣 = 𝒫 𝑋) | |
| 4 | 3 | adantr 480 | . . . 4 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → 𝒫 𝑣 = 𝒫 𝑋) |
| 5 | ineq1 4167 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓 ∩ 𝒫 𝑥) = (𝐹 ∩ 𝒫 𝑥)) | |
| 6 | 5 | neeq1d 2992 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅)) |
| 7 | 6 | adantl 481 | . . . 4 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅)) |
| 8 | 4, 7 | rabeqbidv 3419 | . . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| 9 | 8 | adantl 481 | . 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ (𝑣 = 𝑋 ∧ 𝑓 = 𝐹)) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| 10 | fveq2 6842 | . . 3 ⊢ (𝑣 = 𝑋 → (fBas‘𝑣) = (fBas‘𝑋)) | |
| 11 | 10 | adantl 481 | . 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝑣 = 𝑋) → (fBas‘𝑣) = (fBas‘𝑋)) |
| 12 | elfvex 6877 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ V) | |
| 13 | id 22 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 14 | elfvdm 6876 | . . 3 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ dom fBas) | |
| 15 | pwexg 5325 | . . 3 ⊢ (𝑋 ∈ dom fBas → 𝒫 𝑋 ∈ V) | |
| 16 | rabexg 5284 | . . 3 ⊢ (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V) | |
| 17 | 14, 15, 16 | 3syl 18 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V) |
| 18 | 2, 9, 11, 12, 13, 17 | ovmpodx 7519 | 1 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝑋filGen𝐹) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 {crab 3401 Vcvv 3442 ∩ cin 3902 ∅c0 4287 𝒫 cpw 4556 dom cdm 5632 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 fBascfbas 21309 filGencfg 21310 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-iota 6456 df-fun 6502 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-fg 21319 |
| This theorem is referenced by: elfg 23827 restmetu 24526 neifg 36584 |
| Copyright terms: Public domain | W3C validator |