| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > filsspw | Structured version Visualization version GIF version | ||
| Description: A filter is a subset of the power set of the base set. (Contributed by Stefan O'Rear, 28-Jul-2015.) |
| Ref | Expression |
|---|---|
| filsspw | ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ⊆ 𝒫 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | filfbas 24061 | . 2 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 2 | fbsspw 24045 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝐹 ⊆ 𝒫 𝑋) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ⊆ 𝒫 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2146 ⊆ wss 3906 𝒫 cpw 4564 ‘cfv 6541 fBascfbas 21565 Filcfil 24058 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6497 df-fun 6543 df-fv 6549 df-fbas 21574 df-fil 24059 |
| This theorem is used by: isfil2 24069 infil 24076 filunibas 24094 trfg 24104 isufil2 24121 filssufilg 24124 ssufl 24131 ufileu 24132 filufint 24133 uffixfr 24136 elflim 24184 fclsfnflim 24240 flimfnfcls 24241 metust 24771 cfilresi 25510 cmetss 25531 |
| Copyright terms: Public domain | W3C validator |