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

Theorem filfi 23805
Description: A filter is closed under taking intersections. (Contributed by Mario Carneiro, 27-Nov-2013.) (Revised by Stefan O'Rear, 28-Jul-2015.)
Assertion
Ref Expression
filfi (𝐹 ∈ (Fil‘𝑋) → (fi‘𝐹) = 𝐹)

Proof of Theorem filfi
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 filin 23800 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑥𝐹𝑦𝐹) → (𝑥𝑦) ∈ 𝐹)
213expib 1123 . . 3 (𝐹 ∈ (Fil‘𝑋) → ((𝑥𝐹𝑦𝐹) → (𝑥𝑦) ∈ 𝐹))
32ralrimivv 3176 . 2 (𝐹 ∈ (Fil‘𝑋) → ∀𝑥𝐹𝑦𝐹 (𝑥𝑦) ∈ 𝐹)
4 inficl 9330 . 2 (𝐹 ∈ (Fil‘𝑋) → (∀𝑥𝐹𝑦𝐹 (𝑥𝑦) ∈ 𝐹 ↔ (fi‘𝐹) = 𝐹))
53, 4mpbid 232 1 (𝐹 ∈ (Fil‘𝑋) → (fi‘𝐹) = 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  wral 3050  cin 3899  cfv 6491  ficfi 9315  Filcfil 23791
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 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-nel 3036  df-ral 3051  df-rex 3060  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4902  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-ord 6319  df-on 6320  df-lim 6321  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-om 7809  df-1o 8397  df-2o 8398  df-en 8886  df-fin 8889  df-fi 9316  df-fbas 21308  df-fil 23792
This theorem is referenced by:  filintn0  23807  fclscmpi  23975  alexsublem  23990  iscmet3  25251
  Copyright terms: Public domain W3C validator