| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0nelfil | Structured version Visualization version GIF version | ||
| Description: The empty set doesn't belong to a filter. (Contributed by FL, 20-Jul-2007.) (Revised by Mario Carneiro, 28-Jul-2015.) |
| Ref | Expression |
|---|---|
| 0nelfil | ⊢ (𝐹 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | filfbas 23974 | . 2 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 2 | 0nelfb 23957 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → ¬ ∅ ∈ 𝐹) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝐹 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2149 ∅c0 4294 ‘cfv 6537 fBascfbas 21479 Filcfil 23971 |
| 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 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 |
| 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-nel 3071 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fv 6545 df-fbas 21488 df-fil 23972 |
| This theorem is referenced by: fileln0 23976 isfil2 23982 infil 23989 filuni 24011 filufint 24046 rnelfmlem 24078 fmfnfm 24084 fclscmpi 24155 |
| Copyright terms: Public domain | W3C validator |