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

Theorem tgtop11 20726
 Description: The topology generation function is one-to-one when applied to completed topologies. (Contributed by NM, 18-Jul-2006.)
Assertion
Ref Expression
tgtop11 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ (topGen‘𝐽) = (topGen‘𝐾)) → 𝐽 = 𝐾)

Proof of Theorem tgtop11
StepHypRef Expression
1 tgtop 20717 . . 3 (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽)
2 tgtop 20717 . . 3 (𝐾 ∈ Top → (topGen‘𝐾) = 𝐾)
31, 2eqeqan12d 2637 . 2 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → ((topGen‘𝐽) = (topGen‘𝐾) ↔ 𝐽 = 𝐾))
43biimp3a 1429 1 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ (topGen‘𝐽) = (topGen‘𝐾)) → 𝐽 = 𝐾)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ w3a 1036   = wceq 1480   ∈ wcel 1987  ‘cfv 5857  topGenctg 16038  Topctop 20638 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-rab 2917  df-v 3192  df-sbc 3423  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-iota 5820  df-fun 5859  df-fv 5865  df-topgen 16044  df-top 20639 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator