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

Theorem toprntopon 22900
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 22893 . . . . 5 (𝑥 ∈ Top ↔ 𝑥 ∈ (TopOn‘ 𝑥))
2 fvex 6847 . . . . . 6 (TopOn‘ 𝑥) ∈ V
3 eleq2 2826 . . . . . . . 8 (𝑦 = (TopOn‘ 𝑥) → (𝑥𝑦𝑥 ∈ (TopOn‘ 𝑥)))
4 eleq1 2825 . . . . . . . 8 (𝑦 = (TopOn‘ 𝑥) → (𝑦 ∈ ran TopOn ↔ (TopOn‘ 𝑥) ∈ ran TopOn))
53, 4anbi12d 633 . . . . . . 7 (𝑦 = (TopOn‘ 𝑥) → ((𝑥𝑦𝑦 ∈ ran TopOn) ↔ (𝑥 ∈ (TopOn‘ 𝑥) ∧ (TopOn‘ 𝑥) ∈ ran TopOn)))
6 simpl 482 . . . . . . . 8 ((𝑥 ∈ (TopOn‘ 𝑥) ∧ (TopOn‘ 𝑥) ∈ ran TopOn) → 𝑥 ∈ (TopOn‘ 𝑥))
7 fntopon 22899 . . . . . . . . . 10 TopOn Fn V
8 vuniex 7686 . . . . . . . . . 10 𝑥 ∈ V
9 fnfvelrn 7026 . . . . . . . . . 10 ((TopOn Fn V ∧ 𝑥 ∈ V) → (TopOn‘ 𝑥) ∈ ran TopOn)
107, 8, 9mp2an 693 . . . . . . . . 9 (TopOn‘ 𝑥) ∈ ran TopOn
1110jctr 524 . . . . . . . 8 (𝑥 ∈ (TopOn‘ 𝑥) → (𝑥 ∈ (TopOn‘ 𝑥) ∧ (TopOn‘ 𝑥) ∈ ran TopOn))
126, 11impbii 209 . . . . . . 7 ((𝑥 ∈ (TopOn‘ 𝑥) ∧ (TopOn‘ 𝑥) ∈ ran TopOn) ↔ 𝑥 ∈ (TopOn‘ 𝑥))
135, 12bitrdi 287 . . . . . 6 (𝑦 = (TopOn‘ 𝑥) → ((𝑥𝑦𝑦 ∈ ran TopOn) ↔ 𝑥 ∈ (TopOn‘ 𝑥)))
142, 13spcev 3549 . . . . 5 (𝑥 ∈ (TopOn‘ 𝑥) → ∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn))
151, 14sylbi 217 . . . 4 (𝑥 ∈ Top → ∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn))
16 funtopon 22895 . . . . . . . . 9 Fun TopOn
17 elrnrexdm 7035 . . . . . . . . 9 (Fun TopOn → (𝑦 ∈ ran TopOn → ∃𝑧 ∈ dom TopOn𝑦 = (TopOn‘𝑧)))
1816, 17ax-mp 5 . . . . . . . 8 (𝑦 ∈ ran TopOn → ∃𝑧 ∈ dom TopOn𝑦 = (TopOn‘𝑧))
19 rexex 3068 . . . . . . . 8 (∃𝑧 ∈ dom TopOn𝑦 = (TopOn‘𝑧) → ∃𝑧 𝑦 = (TopOn‘𝑧))
2018, 19syl 17 . . . . . . 7 (𝑦 ∈ ran TopOn → ∃𝑧 𝑦 = (TopOn‘𝑧))
21 19.42v 1955 . . . . . . . 8 (∃𝑧(𝑥𝑦𝑦 = (TopOn‘𝑧)) ↔ (𝑥𝑦 ∧ ∃𝑧 𝑦 = (TopOn‘𝑧)))
22 eqimss 3981 . . . . . . . . . . 11 (𝑦 = (TopOn‘𝑧) → 𝑦 ⊆ (TopOn‘𝑧))
2322sseld 3921 . . . . . . . . . 10 (𝑦 = (TopOn‘𝑧) → (𝑥𝑦𝑥 ∈ (TopOn‘𝑧)))
2423impcom 407 . . . . . . . . 9 ((𝑥𝑦𝑦 = (TopOn‘𝑧)) → 𝑥 ∈ (TopOn‘𝑧))
2524eximi 1837 . . . . . . . 8 (∃𝑧(𝑥𝑦𝑦 = (TopOn‘𝑧)) → ∃𝑧 𝑥 ∈ (TopOn‘𝑧))
2621, 25sylbir 235 . . . . . . 7 ((𝑥𝑦 ∧ ∃𝑧 𝑦 = (TopOn‘𝑧)) → ∃𝑧 𝑥 ∈ (TopOn‘𝑧))
2720, 26sylan2 594 . . . . . 6 ((𝑥𝑦𝑦 ∈ ran TopOn) → ∃𝑧 𝑥 ∈ (TopOn‘𝑧))
28 topontop 22888 . . . . . . 7 (𝑥 ∈ (TopOn‘𝑧) → 𝑥 ∈ Top)
2928exlimiv 1932 . . . . . 6 (∃𝑧 𝑥 ∈ (TopOn‘𝑧) → 𝑥 ∈ Top)
3027, 29syl 17 . . . . 5 ((𝑥𝑦𝑦 ∈ ran TopOn) → 𝑥 ∈ Top)
3130exlimiv 1932 . . . 4 (∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn) → 𝑥 ∈ Top)
3215, 31impbii 209 . . 3 (𝑥 ∈ Top ↔ ∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn))
33 eluni 4854 . . 3 (𝑥 ran TopOn ↔ ∃𝑦(𝑥𝑦𝑦 ∈ ran TopOn))
3432, 33bitr4i 278 . 2 (𝑥 ∈ Top ↔ 𝑥 ran TopOn)
3534eqriv 2734 1 Top = ran TopOn
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wex 1781  wcel 2114  wrex 3062  Vcvv 3430   cuni 4851  dom cdm 5624  ran crn 5625  Fun wfun 6486   Fn wfn 6487  cfv 6492  Topctop 22868  TopOnctopon 22885
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-fv 6500  df-topon 22886
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator