| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A filter generates itself. (Contributed by Jeff Hankins, 5-Sep-2009.) |
| Ref | Expression |
|---|---|
| fgid |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | filfbas 10276 |
. . . . 5
| |
| 2 | eqid 1884 |
. . . . . 6
| |
| 3 | 2 | elfg 10284 |
. . . . 5
|
| 4 | 1, 3 | syl 12 |
. . . 4
|
| 5 | 2 | fillsb 10270 |
. . . . . . . . 9
|
| 6 | 5 | 3expd 1085 |
. . . . . . . 8
|
| 7 | 6 | com34 40 |
. . . . . . 7
|
| 8 | 7 | r19.23adv 2215 |
. . . . . 6
|
| 9 | 8 | com23 36 |
. . . . 5
|
| 10 | 9 | imp3a 388 |
. . . 4
|
| 11 | 4, 10 | sylbid 220 |
. . 3
|
| 12 | 11 | ssrdv 2622 |
. 2
|
| 13 | fbssfg 10285 |
. . 3
| |
| 14 | 1, 13 | syl 12 |
. 2
|
| 15 | 12, 14 | eqssd 2633 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: fbfgss2 14937 filfm 15600 isfclusf 15625 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-9 1307 ax-10 1308 ax-11 1309 ax-12 1310 ax-13 1311 ax-14 1312 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-16 1580 ax-11o 1588 ax-ext 1865 ax-sep 3438 ax-nul 3445 ax-pow 3481 ax-pr 3524 ax-un 3790 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-3an 860 df-ex 1327 df-sb 1536 df-eu 1775 df-mo 1776 df-clab 1872 df-cleq 1877 df-clel 1880 df-ne 2019 df-nel 2020 df-ral 2109 df-rex 2110 df-rab 2112 df-v 2294 df-dif 2597 df-un 2600 df-in 2603 df-ss 2605 df-nul 2876 df-pw 3035 df-sn 3049 df-pr 3050 df-op 3053 df-uni 3178 df-br 3339 df-opab 3396 df-id 3586 df-xp 4000 df-rel 4001 df-cnv 4002 df-co 4003 df-dm 4004 df-rn 4005 df-res 4006 df-ima 4007 df-fun 4008 df-fv 4014 df-fbas 10259 df-fg 10260 df-fil 10265 |