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

Theorem isfil 23734
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 23733 . 2 Fil = (𝑧 ∈ V ↦ {𝑓 ∈ (fBas‘𝑧) ∣ ∀𝑥 ∈ 𝒫 𝑧((𝑓 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝑓)})
2 pweq 4577 . . . 4 (𝑧 = 𝑋 → 𝒫 𝑧 = 𝒫 𝑋)
32adantr 480 . . 3 ((𝑧 = 𝑋𝑓 = 𝐹) → 𝒫 𝑧 = 𝒫 𝑋)
4 ineq1 4176 . . . . . 6 (𝑓 = 𝐹 → (𝑓 ∩ 𝒫 𝑥) = (𝐹 ∩ 𝒫 𝑥))
54neeq1d 2984 . . . . 5 (𝑓 = 𝐹 → ((𝑓 ∩ 𝒫 𝑥) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝑥) ≠ ∅))
6 eleq2 2817 . . . . 5 (𝑓 = 𝐹 → (𝑥𝑓𝑥𝐹))
75, 6imbi12d 344 . . . 4 (𝑓 = 𝐹 → (((𝑓 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝑓) ↔ ((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝐹)))
87adantl 481 . . 3 ((𝑧 = 𝑋𝑓 = 𝐹) → (((𝑓 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝑓) ↔ ((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝐹)))
93, 8raleqbidv 3319 . 2 ((𝑧 = 𝑋𝑓 = 𝐹) → (∀𝑥 ∈ 𝒫 𝑧((𝑓 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝑓) ↔ ∀𝑥 ∈ 𝒫 𝑋((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝐹)))
10 fveq2 6858 . 2 (𝑧 = 𝑋 → (fBas‘𝑧) = (fBas‘𝑋))
11 fvex 6871 . 2 (fBas‘𝑧) ∈ V
12 elfvdm 6895 . 2 (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ dom fBas)
131, 9, 10, 11, 12elmptrab2 23715 1 (𝐹 ∈ (Fil‘𝑋) ↔ (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑥 ∈ 𝒫 𝑋((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥𝐹)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wne 2925  wral 3044  cin 3913  c0 4296  𝒫 cpw 4563  dom cdm 5638  cfv 6511  fBascfbas 21252  Filcfil 23732
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fv 6519  df-fil 23733
This theorem is referenced by:  filfbas  23735  filss  23740  isfil2  23743  ustfilxp  24100
  Copyright terms: Public domain W3C validator