| 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 21485 | . . 3 ⊢ filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅}) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → filGen = (𝑣 ∈ V, 𝑓 ∈ (fBas‘𝑣) ↦ {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅})) |
| 3 | pweq 4578 | . . . . 5 ⊢ (𝑣 = 𝑋 → 𝒫 𝑣 = 𝒫 𝑋) | |
| 4 | 3 | adantr 485 | . . . 4 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → 𝒫 𝑣 = 𝒫 𝑋) |
| 5 | ineq1 4174 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓 ∩ 𝒫 𝑥) = (𝐹 ∩ 𝒫 𝑥)) | |
| 6 | 5 | neeq1d 3023 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅)) |
| 7 | 6 | adantl 486 | . . . 4 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅)) |
| 8 | 4, 7 | rabeqbidv 3441 | . . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑓 = 𝐹) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| 9 | 8 | adantl 486 | . 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ (𝑣 = 𝑋 ∧ 𝑓 = 𝐹)) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑓 ∩ 𝒫 𝑥) ≠ ∅} = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| 10 | fveq2 6879 | . . 3 ⊢ (𝑣 = 𝑋 → (fBas‘𝑣) = (fBas‘𝑋)) | |
| 11 | 10 | adantl 486 | . 2 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝑣 = 𝑋) → (fBas‘𝑣) = (fBas‘𝑋)) |
| 12 | elfvex 6914 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ V) | |
| 13 | id 23 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 14 | elfvdm 6913 | . . 3 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ dom fBas) | |
| 15 | pwexg 5347 | . . 3 ⊢ (𝑋 ∈ dom fBas → 𝒫 𝑋 ∈ V) | |
| 16 | rabexg 5305 | . . 3 ⊢ (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V) | |
| 17 | 14, 15, 16 | 3syl 19 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅} ∈ V) |
| 18 | 2, 9, 11, 12, 13, 17 | ovmpodx 7559 | 1 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝑋filGen𝐹) = {𝑥 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑥) ≠ ∅}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 {crab 3423 Vcvv 3463 ∩ cin 3912 ∅c0 4294 𝒫 cpw 4564 dom cdm 5659 ‘cfv 6533 (class class class)co 7408 ∈ cmpo 7410 fBascfbas 21475 filGencfg 21476 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6489 df-fun 6535 df-fv 6541 df-ov 7411 df-oprab 7412 df-mpo 7413 df-fg 21485 |
| This theorem is referenced by: elfg 23993 restmetu 24692 neifg 36767 |
| Copyright terms: Public domain | W3C validator |