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

Theorem isfil 23904
Description: The predicate "is a filter." (Contributed by FL, 20-Jul-2007.) (Revised by Mario Carneiro, 28-Jul-2015.)
Assertion
Ref Expression
isfil (𝐹 ∈ (Fil‘𝑋) ↔ (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑥 ∈ 𝒫 𝑋((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝐹)))
Distinct variable groups:   𝑥,𝐹   𝑥,𝑋

Proof of Theorem isfil
Dummy variables 𝑓 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-fil 23903 . 2 Fil = (𝑧 ∈ V ↦ {𝑓 ∈ (fBas‘𝑧) ∣ ∀𝑥 ∈ 𝒫 𝑧((𝑓 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝑓)})
2 pweq 4569 . . . 4 (𝑧 = 𝑋 → 𝒫 𝑧 = 𝒫 𝑋)
32adantr 484 . . 3 ((𝑧 = 𝑋𝑓 = 𝐹) → 𝒫 𝑧 = 𝒫 𝑋)
4 ineq1 4165 . . . . . 6 (𝑓 = 𝐹 → (𝑓 ∩ 𝒫 𝑥) = (𝐹 ∩ 𝒫 𝑥))
54neeq1d 3016 . . . . 5 (𝑓 = 𝐹 → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅))
6 eleq2 2851 . . . . 5 (𝑓 = 𝐹 → (𝑥𝑓𝑥𝐹))
75, 6imbi12d 346 . . . 4 (𝑓 = 𝐹 → (((𝑓 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝑓) ↔ ((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝐹)))
87adantl 485 . . 3 ((𝑧 = 𝑋𝑓 = 𝐹) → (((𝑓 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝑓) ↔ ((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝐹)))
93, 8raleqbidv 3336 . 2 ((𝑧 = 𝑋𝑓 = 𝐹) → (∀𝑥 ∈ 𝒫 𝑧((𝑓 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝑓) ↔ ∀𝑥 ∈ 𝒫 𝑋((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝐹)))
10 fveq2 6867 . 2 (𝑧 = 𝑋 → (fBas‘𝑧) = (fBas‘𝑋))
11 fvex 6880 . 2 (fBas‘𝑧) ∈ V
12 elfvdm 6901 . 2 (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ dom fBas)
131, 9, 10, 11, 12elmptrab2 23885 1 (𝐹 ∈ (Fil‘𝑋) ↔ (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑥 ∈ 𝒫 𝑋((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝐹)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1560  wcel 2142  wne 2957  wral 3076  cin 3903  c0 4285  𝒫 cpw 4555  dom cdm 5647  cfv 6521  fBascfbas 21409  Filcfil 23902
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pr 5390
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fv 6529  df-fil 23903
This theorem is referenced by:  filfbas  23905  filss  23910  isfil2  23913  ustfilxp  24270
  Copyright terms: Public domain W3C validator