| 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 24222 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 2 | fbasssin 24210 | . . 3 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) | |
| 3 | 1, 2 | syl3an1 1181 | . 2 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) |
| 4 | inss1 4136 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 5 | filelss 24226 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → 𝐴 ⊆ 𝑋) | |
| 6 | 4, 5 | sstrid 3924 | . . . 4 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → (𝐴 ∩ 𝐵) ⊆ 𝑋) |
| 7 | filss 24227 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ∈ 𝐹 ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋 ∧ 𝑥 ⊆ (𝐴 ∩ 𝐵))) → (𝐴 ∩ 𝐵) ∈ 𝐹) | |
| 8 | 7 | 3exp2 1373 | . . . . . . 7 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝐹 → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
| 9 | 8 | com23 87 | . . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
| 10 | 9 | imp 412 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋) → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹))) |
| 11 | 10 | rexlimdv 3165 | . . . 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 2147 ∃wrex 3090 ⊆ wss 3900 ∩ cin 4092 ‘cfv 6566 fBascfbas 21717 Filcfil 24219 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fv 6574 df-fbas 21726 df-fil 24220 |
| This theorem is used by: isfil2 24230 filfi 24233 filinn0 24234 infil 24237 filconn 24257 filuni 24259 trfil2 24261 trfilss 24263 ufprim 24283 filufint 24294 rnelfmlem 24326 rnelfm 24327 fmfnfmlem2 24329 fmfnfmlem3 24330 fmfnfmlem4 24331 fmfnfm 24332 txflf 24380 fclsrest 24398 metust 24932 filnetlem3 37383 |
| Copyright terms: Public domain | W3C validator |