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

Theorem filunirn 23949
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 6880 . . . . . 6 (fBas‘𝑦) ∈ V
21rabex 5296 . . . . 5 {𝑤 ∈ (fBas‘𝑦) ∣ ∀𝑧 ∈ 𝒫 𝑦((𝑤 ∩ 𝒫 𝑧) ≠ ∅ → 𝑧𝑤)} ∈ V
3 df-fil 23913 . . . . 5 Fil = (𝑦 ∈ V ↦ {𝑤 ∈ (fBas‘𝑦) ∣ ∀𝑧 ∈ 𝒫 𝑦((𝑤 ∩ 𝒫 𝑧) ≠ ∅ → 𝑧𝑤)})
42, 3fnmpti 6664 . . . 4 Fil Fn V
5 fnunirn 7237 . . . 4 (Fil Fn V → (𝐹 ran Fil ↔ ∃𝑥 ∈ V 𝐹 ∈ (Fil‘𝑥)))
64, 5ax-mp 5 . . 3 (𝐹 ran Fil ↔ ∃𝑥 ∈ V 𝐹 ∈ (Fil‘𝑥))
7 filunibas 23948 . . . . . . 7 (𝐹 ∈ (Fil‘𝑥) → 𝐹 = 𝑥)
87fveq2d 6871 . . . . . 6 (𝐹 ∈ (Fil‘𝑥) → (Fil‘ 𝐹) = (Fil‘𝑥))
98eleq2d 2849 . . . . 5 (𝐹 ∈ (Fil‘𝑥) → (𝐹 ∈ (Fil‘ 𝐹) ↔ 𝐹 ∈ (Fil‘𝑥)))
109ibir 270 . . . 4 (𝐹 ∈ (Fil‘𝑥) → 𝐹 ∈ (Fil‘ 𝐹))
1110rexlimivw 3160 . . 3 (∃𝑥 ∈ V 𝐹 ∈ (Fil‘𝑥) → 𝐹 ∈ (Fil‘ 𝐹))
126, 11sylbi 219 . 2 (𝐹 ran Fil → 𝐹 ∈ (Fil‘ 𝐹))
13 fvssunirn 6898 . . 3 (Fil‘ 𝐹) ⊆ ran Fil
1413sseli 3933 . 2 (𝐹 ∈ (Fil‘ 𝐹) → 𝐹 ran Fil)
1512, 14impbii 211 1 (𝐹 ran Fil ↔ 𝐹 ∈ (Fil‘ 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wcel 2143  wne 2958  wral 3077  wrex 3087  {crab 3415  Vcvv 3455  cin 3904  c0 4286  𝒫 cpw 4556   cuni 4866  ran crn 5649   Fn wfn 6516  cfv 6521  fBascfbas 21419  Filcfil 23912
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5247  ax-nul 5257  ax-pow 5323  ax-pr 5391
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3063  df-ral 3078  df-rex 3088  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5102  df-opab 5164  df-mpt 5183  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-iota 6477  df-fun 6523  df-fn 6524  df-fv 6529  df-fbas 21428  df-fil 23913
This theorem is referenced by:  flimfil  24036  isfcls  24076
  Copyright terms: Public domain W3C validator