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

Theorem filunirn 23802
Description: Two ways to express a filter on an unspecified base. (Contributed by Stefan O'Rear, 2-Aug-2015.)
Assertion
Ref Expression
filunirn (𝐹 ran Fil ↔ 𝐹 ∈ (Fil‘ 𝐹))

Proof of Theorem filunirn
Dummy variables 𝑦 𝑤 𝑧 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6853 . . . . . 6 (fBas‘𝑦) ∈ V
21rabex 5289 . . . . 5 {𝑤 ∈ (fBas‘𝑦) ∣ ∀𝑧 ∈ 𝒫 𝑦((𝑤 ∩ 𝒫 𝑧) ≠ ∅ → 𝑧𝑤)} ∈ V
3 df-fil 23766 . . . . 5 Fil = (𝑦 ∈ V ↦ {𝑤 ∈ (fBas‘𝑦) ∣ ∀𝑧 ∈ 𝒫 𝑦((𝑤 ∩ 𝒫 𝑧) ≠ ∅ → 𝑧𝑤)})
42, 3fnmpti 6643 . . . 4 Fil Fn V
5 fnunirn 7210 . . . 4 (Fil Fn V → (𝐹 ran Fil ↔ ∃𝑥 ∈ V 𝐹 ∈ (Fil‘𝑥)))
64, 5ax-mp 5 . . 3 (𝐹 ran Fil ↔ ∃𝑥 ∈ V 𝐹 ∈ (Fil‘𝑥))
7 filunibas 23801 . . . . . . 7 (𝐹 ∈ (Fil‘𝑥) → 𝐹 = 𝑥)
87fveq2d 6844 . . . . . 6 (𝐹 ∈ (Fil‘𝑥) → (Fil‘ 𝐹) = (Fil‘𝑥))
98eleq2d 2814 . . . . 5 (𝐹 ∈ (Fil‘𝑥) → (𝐹 ∈ (Fil‘ 𝐹) ↔ 𝐹 ∈ (Fil‘𝑥)))
109ibir 268 . . . 4 (𝐹 ∈ (Fil‘𝑥) → 𝐹 ∈ (Fil‘ 𝐹))
1110rexlimivw 3130 . . 3 (∃𝑥 ∈ V 𝐹 ∈ (Fil‘𝑥) → 𝐹 ∈ (Fil‘ 𝐹))
126, 11sylbi 217 . 2 (𝐹 ran Fil → 𝐹 ∈ (Fil‘ 𝐹))
13 fvssunirn 6873 . . 3 (Fil‘ 𝐹) ⊆ ran Fil
1413sseli 3939 . 2 (𝐹 ∈ (Fil‘ 𝐹) → 𝐹 ran Fil)
1512, 14impbii 209 1 (𝐹 ran Fil ↔ 𝐹 ∈ (Fil‘ 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wcel 2109  wne 2925  wral 3044  wrex 3053  {crab 3402  Vcvv 3444  cin 3910  c0 4292  𝒫 cpw 4559   cuni 4867  ran crn 5632   Fn wfn 6494  cfv 6499  fBascfbas 21284  Filcfil 23765
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 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382
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-nel 3030  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  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-iota 6452  df-fun 6501  df-fn 6502  df-fv 6507  df-fbas 21293  df-fil 23766
This theorem is referenced by:  flimfil  23889  isfcls  23929
  Copyright terms: Public domain W3C validator