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 22999 | . 2 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
2 | fbsspw 22983 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝐹 ⊆ 𝒫 𝑋) | |
3 | 1, 2 | syl 17 | 1 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ⊆ 𝒫 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2106 ⊆ wss 3887 𝒫 cpw 4533 ‘cfv 6433 fBascfbas 20585 Filcfil 22996 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fv 6441 df-fbas 20594 df-fil 22997 |
This theorem is referenced by: isfil2 23007 infil 23014 filunibas 23032 trfg 23042 isufil2 23059 filssufilg 23062 ssufl 23069 ufileu 23070 filufint 23071 uffixfr 23074 elflim 23122 fclsfnflim 23178 flimfnfcls 23179 metust 23714 cfilresi 24459 cmetss 24480 |
Copyright terms: Public domain | W3C validator |