| 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 23813 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 2 | fbasssin 23801 | . . 3 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) | |
| 3 | 1, 2 | syl3an1 1164 | . 2 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) |
| 4 | inss1 4177 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 5 | filelss 23817 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → 𝐴 ⊆ 𝑋) | |
| 6 | 4, 5 | sstrid 3933 | . . . 4 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → (𝐴 ∩ 𝐵) ⊆ 𝑋) |
| 7 | filss 23818 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ∈ 𝐹 ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋 ∧ 𝑥 ⊆ (𝐴 ∩ 𝐵))) → (𝐴 ∩ 𝐵) ∈ 𝐹) | |
| 8 | 7 | 3exp2 1356 | . . . . . . 7 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝐹 → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
| 9 | 8 | com23 86 | . . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
| 10 | 9 | imp 406 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋) → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹))) |
| 11 | 10 | rexlimdv 3136 | . . . 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 3061 ∩ cin 3888 ⊆ wss 3889 ‘cfv 6498 fBascfbas 21340 Filcfil 23810 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fv 6506 df-fbas 21349 df-fil 23811 |
| This theorem is referenced by: isfil2 23821 filfi 23824 filinn0 23825 infil 23828 filconn 23848 filuni 23850 trfil2 23852 trfilss 23854 ufprim 23874 filufint 23885 rnelfmlem 23917 rnelfm 23918 fmfnfmlem2 23920 fmfnfmlem3 23921 fmfnfmlem4 23922 fmfnfm 23923 txflf 23971 fclsrest 23989 metust 24523 filnetlem3 36562 |
| Copyright terms: Public domain | W3C validator |