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

Theorem toprntopon 22915
Description: A topology is the same thing as a topology on a set (variable-free version). (Contributed by BJ, 27-Apr-2021.)
Assertion
Ref Expression
toprntopon Top = ran TopOn

Proof of Theorem toprntopon
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 toptopon2 22908 . . . . 5 (𝑥 ∈ Top ↔ 𝑥 ∈ (TopOn‘ 𝑥))
2 fvex 6847 . . . . . 6 (TopOn‘ 𝑥) ∈ V
3 eleq2 2829 . . . . . . . 8 (𝑦 = (TopOn‘ 𝑥) → (𝑥𝑦𝑥 ∈ (TopOn‘ 𝑥)))
4 eleq1 2828 . . . . . . . 8 (𝑦 = (TopOn‘ 𝑥) → (𝑦 ∈ ran TopOn ↔ (TopOn‘ 𝑥) ∈ ran TopOn))
53, 4anbi12d 638 . . . . . . 7 (𝑦 = (TopOn‘ 𝑥) → ((𝑥𝑦𝑦 ∈ ran TopOn) ↔ (𝑥 ∈ (TopOn‘ 𝑥) ∧ (TopOn‘ 𝑥) ∈ ran TopOn)))
6 simpl 483 . . . . . . . 8 ((𝑥 ∈ (TopOn‘ 𝑥) ∧ (TopOn‘ 𝑥) ∈ ran TopOn) → 𝑥 ∈ (TopOn‘ 𝑥))
7 fntopon 22914 . . . . . . . . . 10 TopOn Fn V
8 vuniex 7689 . . . . . . . . . 10 𝑥 ∈ V
9 fnfvelrn 7028 . . . . . . . . . 10 ((TopOn Fn V ∧ 𝑥 ∈ V) → (TopOn‘ 𝑥) ∈ ran TopOn)
107, 8, 9mp2an 698 . . . . . . . . 9 (TopOn‘ 𝑥) ∈ ran TopOn
1110jctr 529 . . . . . . . 8 (𝑥 ∈ (TopOn‘ 𝑥) → (𝑥 ∈ (TopOn‘ 𝑥) ∧ (TopOn‘ 𝑥) ∈ ran TopOn))
126, 11impbii 210 . . . . . . 7 ((𝑥 ∈ (TopOn‘ 𝑥) ∧ (TopOn‘ 𝑥) ∈ ran TopOn) ↔ 𝑥 ∈ (TopOn‘ 𝑥))
135, 12bitrdi 288 . . . . . 6 (𝑦 = (TopOn‘ 𝑥) → ((𝑥𝑦𝑦 ∈ ran TopOn) ↔ 𝑥 ∈ (TopOn‘ 𝑥)))
142, 13spcev 3551 . . . . 5 (𝑥 ∈ (TopOn‘ 𝑥) → ∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn))
151, 14sylbi 218 . . . 4 (𝑥 ∈ Top → ∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn))
16 funtopon 22910 . . . . . . . . 9 Fun TopOn
17 elrnrexdm 7037 . . . . . . . . 9 (Fun TopOn → (𝑦 ∈ ran TopOn → ∃𝑧 ∈ dom TopOn𝑦 = (TopOn‘𝑧)))
1816, 17ax-mp 5 . . . . . . . 8 (𝑦 ∈ ran TopOn → ∃𝑧 ∈ dom TopOn𝑦 = (TopOn‘𝑧))
19 rexex 3070 . . . . . . . 8 (∃𝑧 ∈ dom TopOn𝑦 = (TopOn‘𝑧) → ∃𝑧 𝑦 = (TopOn‘𝑧))
2018, 19syl 17 . . . . . . 7 (𝑦 ∈ ran TopOn → ∃𝑧 𝑦 = (TopOn‘𝑧))
21 19.42v 1960 . . . . . . . 8 (∃𝑧(𝑥𝑦𝑦 = (TopOn‘𝑧)) ↔ (𝑥𝑦 ∧ ∃𝑧 𝑦 = (TopOn‘𝑧)))
22 eqimss 3980 . . . . . . . . . . 11 (𝑦 = (TopOn‘𝑧) → 𝑦 ⊆ (TopOn‘𝑧))
2322sseld 3921 . . . . . . . . . 10 (𝑦 = (TopOn‘𝑧) → (𝑥𝑦𝑥 ∈ (TopOn‘𝑧)))
2423impcom 408 . . . . . . . . 9 ((𝑥𝑦𝑦 = (TopOn‘𝑧)) → 𝑥 ∈ (TopOn‘𝑧))
2524eximi 1842 . . . . . . . 8 (∃𝑧(𝑥𝑦𝑦 = (TopOn‘𝑧)) → ∃𝑧 𝑥 ∈ (TopOn‘𝑧))
2621, 25sylbir 236 . . . . . . 7 ((𝑥𝑦 ∧ ∃𝑧 𝑦 = (TopOn‘𝑧)) → ∃𝑧 𝑥 ∈ (TopOn‘𝑧))
2720, 26sylan2 599 . . . . . 6 ((𝑥𝑦𝑦 ∈ ran TopOn) → ∃𝑧 𝑥 ∈ (TopOn‘𝑧))
28 topontop 22903 . . . . . . 7 (𝑥 ∈ (TopOn‘𝑧) → 𝑥 ∈ Top)
2928exlimiv 1937 . . . . . 6 (∃𝑧 𝑥 ∈ (TopOn‘𝑧) → 𝑥 ∈ Top)
3027, 29syl 17 . . . . 5 ((𝑥𝑦𝑦 ∈ ran TopOn) → 𝑥 ∈ Top)
3130exlimiv 1937 . . . 4 (∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn) → 𝑥 ∈ Top)
3215, 31impbii 210 . . 3 (𝑥 ∈ Top ↔ ∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn))
33 eluni 4848 . . 3 (𝑥 ran TopOn ↔ ∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn))
3432, 33bitr4i 279 . 2 (𝑥 ∈ Top ↔ 𝑥 ran TopOn)
3534eqriv 2737 1 Top = ran TopOn
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wex 1786  wcel 2119  wrex 3064  Vcvv 3432   cuni 4845  dom cdm 5625  ran crn 5626  Fun wfun 6486   Fn wfn 6487  cfv 6492  Topctop 22883  TopOnctopon 22900
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-iota 6448  df-fun 6494  df-fn 6495  df-fv 6500  df-topon 22901
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator