| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > filin | Structured version Visualization version GIF version | ||
| Description: A filter is closed under taking intersections. (Contributed by FL, 20-Jul-2007.) (Revised by Stefan O'Rear, 28-Jul-2015.) |
| Ref | Expression |
|---|---|
| filin | ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → (𝐴 ∩ 𝐵) ∈ 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | filfbas 24058 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 2 | fbasssin 24046 | . . 3 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) | |
| 3 | 1, 2 | syl3an1 1181 | . 2 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) |
| 4 | inss1 4189 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 5 | filelss 24062 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → 𝐴 ⊆ 𝑋) | |
| 6 | 4, 5 | sstrid 3949 | . . . 4 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → (𝐴 ∩ 𝐵) ⊆ 𝑋) |
| 7 | filss 24063 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ∈ 𝐹 ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋 ∧ 𝑥 ⊆ (𝐴 ∩ 𝐵))) → (𝐴 ∩ 𝐵) ∈ 𝐹) | |
| 8 | 7 | 3exp2 1373 | . . . . . . 7 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝐹 → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
| 9 | 8 | com23 87 | . . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
| 10 | 9 | imp 412 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋) → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹))) |
| 11 | 10 | rexlimdv 3166 | . . . 4 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋) → (∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)) |
| 12 | 6, 11 | syldan 603 | . . 3 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → (∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)) |
| 13 | 12 | 3adant3 1150 | . 2 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → (∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)) |
| 14 | 3, 13 | mpd 16 | 1 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → (𝐴 ∩ 𝐵) ∈ 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2146 ∃wrex 3091 ∩ cin 3905 ⊆ wss 3906 ‘cfv 6540 fBascfbas 21562 Filcfil 24055 |
| 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 6496 df-fun 6542 df-fv 6548 df-fbas 21571 df-fil 24056 |
| This theorem is used by: isfil2 24066 filfi 24069 filinn0 24070 infil 24073 filconn 24093 filuni 24095 trfil2 24097 trfilss 24099 ufprim 24119 filufint 24130 rnelfmlem 24162 rnelfm 24163 fmfnfmlem2 24165 fmfnfmlem3 24166 fmfnfmlem4 24167 fmfnfm 24168 txflf 24216 fclsrest 24234 metust 24768 filnetlem3 36950 |
| Copyright terms: Public domain | W3C validator |