| 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 23807 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 2 | fbasssin 23795 | . . 3 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) | |
| 3 | 1, 2 | syl3an1 1164 | . 2 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) |
| 4 | inss1 4191 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 5 | filelss 23811 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → 𝐴 ⊆ 𝑋) | |
| 6 | 4, 5 | sstrid 3947 | . . . 4 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → (𝐴 ∩ 𝐵) ⊆ 𝑋) |
| 7 | filss 23812 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ∈ 𝐹 ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋 ∧ 𝑥 ⊆ (𝐴 ∩ 𝐵))) → (𝐴 ∩ 𝐵) ∈ 𝐹) | |
| 8 | 7 | 3exp2 1356 | . . . . . . 7 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝐹 → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
| 9 | 8 | com23 86 | . . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
| 10 | 9 | imp 406 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋) → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹))) |
| 11 | 10 | rexlimdv 3137 | . . . 4 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋) → (∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)) |
| 12 | 6, 11 | syldan 592 | . . 3 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → (∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)) |
| 13 | 12 | 3adant3 1133 | . 2 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → (∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)) |
| 14 | 3, 13 | mpd 15 | 1 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → (𝐴 ∩ 𝐵) ∈ 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 ∈ wcel 2114 ∃wrex 3062 ∩ cin 3902 ⊆ wss 3903 ‘cfv 6500 fBascfbas 21312 Filcfil 23804 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fv 6508 df-fbas 21321 df-fil 23805 |
| This theorem is referenced by: isfil2 23815 filfi 23818 filinn0 23819 infil 23822 filconn 23842 filuni 23844 trfil2 23846 trfilss 23848 ufprim 23868 filufint 23879 rnelfmlem 23911 rnelfm 23912 fmfnfmlem2 23914 fmfnfmlem3 23915 fmfnfmlem4 23916 fmfnfm 23917 txflf 23965 fclsrest 23983 metust 24517 filnetlem3 36600 |
| Copyright terms: Public domain | W3C validator |