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

Theorem filfi 23824
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 23819 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑥𝐹𝑦𝐹) → (𝑥𝑦) ∈ 𝐹)
213expib 1123 . . 3 (𝐹 ∈ (Fil‘𝑋) → ((𝑥𝐹𝑦𝐹) → (𝑥𝑦) ∈ 𝐹))
32ralrimivv 3178 . 2 (𝐹 ∈ (Fil‘𝑋) → ∀𝑥𝐹𝑦𝐹 (𝑥𝑦) ∈ 𝐹)
4 inficl 9338 . 2 (𝐹 ∈ (Fil‘𝑋) → (∀𝑥𝐹𝑦𝐹 (𝑥𝑦) ∈ 𝐹 ↔ (fi‘𝐹) = 𝐹))
53, 4mpbid 232 1 (𝐹 ∈ (Fil‘𝑋) → (fi‘𝐹) = 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  wral 3051  cin 3888  cfv 6498  ficfi 9323  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  ax-un 7689
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 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-reu 3343  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-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  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-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-om 7818  df-1o 8405  df-2o 8406  df-en 8894  df-fin 8897  df-fi 9324  df-fbas 21349  df-fil 23811
This theorem is referenced by:  filintn0  23826  fclscmpi  23994  alexsublem  24009  iscmet3  25260
  Copyright terms: Public domain W3C validator