MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  filin Structured version   Visualization version   GIF version

Theorem filin 23802
Description: A filter is closed under taking intersections. (Contributed by FL, 20-Jul-2007.) (Revised by Stefan O'Rear, 28-Jul-2015.)
Assertion
Ref Expression
filin ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴𝐹𝐵𝐹) → (𝐴𝐵) ∈ 𝐹)

Proof of Theorem filin
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 filfbas 23796 . . 3 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋))
2 fbasssin 23784 . . 3 ((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴𝐹𝐵𝐹) → ∃𝑥𝐹 𝑥 ⊆ (𝐴𝐵))
31, 2syl3an1 1164 . 2 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴𝐹𝐵𝐹) → ∃𝑥𝐹 𝑥 ⊆ (𝐴𝐵))
4 inss1 4190 . . . . 5 (𝐴𝐵) ⊆ 𝐴
5 filelss 23800 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴𝐹) → 𝐴𝑋)
64, 5sstrid 3946 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴𝐹) → (𝐴𝐵) ⊆ 𝑋)
7 filss 23801 . . . . . . . 8 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥𝐹 ∧ (𝐴𝐵) ⊆ 𝑋𝑥 ⊆ (𝐴𝐵))) → (𝐴𝐵) ∈ 𝐹)
873exp2 1356 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → (𝑥𝐹 → ((𝐴𝐵) ⊆ 𝑋 → (𝑥 ⊆ (𝐴𝐵) → (𝐴𝐵) ∈ 𝐹))))
98com23 86 . . . . . 6 (𝐹 ∈ (Fil‘𝑋) → ((𝐴𝐵) ⊆ 𝑋 → (𝑥𝐹 → (𝑥 ⊆ (𝐴𝐵) → (𝐴𝐵) ∈ 𝐹))))
109imp 406 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴𝐵) ⊆ 𝑋) → (𝑥𝐹 → (𝑥 ⊆ (𝐴𝐵) → (𝐴𝐵) ∈ 𝐹)))
1110rexlimdv 3136 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝐴𝐵) ⊆ 𝑋) → (∃𝑥𝐹 𝑥 ⊆ (𝐴𝐵) → (𝐴𝐵) ∈ 𝐹))
126, 11syldan 592 . . 3 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴𝐹) → (∃𝑥𝐹 𝑥 ⊆ (𝐴𝐵) → (𝐴𝐵) ∈ 𝐹))
13123adant3 1133 . 2 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴𝐹𝐵𝐹) → (∃𝑥𝐹 𝑥 ⊆ (𝐴𝐵) → (𝐴𝐵) ∈ 𝐹))
143, 13mpd 15 1 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝐴𝐹𝐵𝐹) → (𝐴𝐵) ∈ 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087  wcel 2114  wrex 3061  cin 3901  wss 3902  cfv 6493  fBascfbas 21301  Filcfil 23793
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 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378
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 3062  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fv 6501  df-fbas 21310  df-fil 23794
This theorem is referenced by:  isfil2  23804  filfi  23807  filinn0  23808  infil  23811  filconn  23831  filuni  23833  trfil2  23835  trfilss  23837  ufprim  23857  filufint  23868  rnelfmlem  23900  rnelfm  23901  fmfnfmlem2  23903  fmfnfmlem3  23904  fmfnfmlem4  23905  fmfnfm  23906  txflf  23954  fclsrest  23972  metust  24506  filnetlem3  36555
  Copyright terms: Public domain W3C validator