![]() |
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 23872 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
2 | fbasssin 23860 | . . 3 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) | |
3 | 1, 2 | syl3an1 1162 | . 2 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵)) |
4 | inss1 4245 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
5 | filelss 23876 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → 𝐴 ⊆ 𝑋) | |
6 | 4, 5 | sstrid 4007 | . . . 4 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → (𝐴 ∩ 𝐵) ⊆ 𝑋) |
7 | filss 23877 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ∈ 𝐹 ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋 ∧ 𝑥 ⊆ (𝐴 ∩ 𝐵))) → (𝐴 ∩ 𝐵) ∈ 𝐹) | |
8 | 7 | 3exp2 1353 | . . . . . . 7 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝐹 → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
9 | 8 | com23 86 | . . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝐴 ∩ 𝐵) ⊆ 𝑋 → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)))) |
10 | 9 | imp 406 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋) → (𝑥 ∈ 𝐹 → (𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹))) |
11 | 10 | rexlimdv 3151 | . . . 4 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴 ∩ 𝐵) ⊆ 𝑋) → (∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)) |
12 | 6, 11 | syldan 591 | . . 3 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹) → (∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)) |
13 | 12 | 3adant3 1131 | . 2 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → (∃𝑥 ∈ 𝐹 𝑥 ⊆ (𝐴 ∩ 𝐵) → (𝐴 ∩ 𝐵) ∈ 𝐹)) |
14 | 3, 13 | mpd 15 | 1 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → (𝐴 ∩ 𝐵) ∈ 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2106 ∃wrex 3068 ∩ cin 3962 ⊆ wss 3963 ‘cfv 6563 fBascfbas 21370 Filcfil 23869 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fv 6571 df-fbas 21379 df-fil 23870 |
This theorem is referenced by: isfil2 23880 filfi 23883 filinn0 23884 infil 23887 filconn 23907 filuni 23909 trfil2 23911 trfilss 23913 ufprim 23933 filufint 23944 rnelfmlem 23976 rnelfm 23977 fmfnfmlem2 23979 fmfnfmlem3 23980 fmfnfmlem4 23981 fmfnfm 23982 txflf 24030 fclsrest 24048 metust 24587 filnetlem3 36363 |
Copyright terms: Public domain | W3C validator |