| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fileln0 | Structured version Visualization version GIF version | ||
| Description: An element of a filter is nonempty. (Contributed by FL, 24-May-2011.) (Revised by Mario Carneiro, 28-Jul-2015.) |
| Ref | Expression |
|---|---|
| fileln0 | ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . 2 ⊢ (𝐴 ∈ 𝐹 → 𝐴 ∈ 𝐹) | |
| 2 | 0nelfil 23967 | . 2 ⊢ (𝐹 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝐹) | |
| 3 | nelne2 3058 | . 2 ⊢ ((𝐴 ∈ 𝐹 ∧ ¬ ∅ ∈ 𝐹) → 𝐴 ≠ ∅) | |
| 4 | 1, 2, 3 | syl2anr 608 | 1 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∈ wcel 2145 ≠ wne 2960 ∅c0 4288 ‘cfv 6525 Filcfil 23963 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fv 6533 df-fbas 21479 df-fil 23964 |
| This theorem is referenced by: filinn0 23978 filintn0 23979 alexsublem 24162 cfil3i 25389 iscmet3 25413 filnetlem4 36754 |
| Copyright terms: Public domain | W3C validator |