Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  pconntop Structured version   Visualization version   GIF version

Theorem pconntop 32375
Description: A simply connected space is a topology. (Contributed by Mario Carneiro, 11-Feb-2015.)
Assertion
Ref Expression
pconntop (𝐽 ∈ PConn → 𝐽 ∈ Top)

Proof of Theorem pconntop
Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2826 . . 3 𝐽 = 𝐽
21ispconn 32373 . 2 (𝐽 ∈ PConn ↔ (𝐽 ∈ Top ∧ ∀𝑥 𝐽𝑦 𝐽𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
32simplbi 498 1 (𝐽 ∈ PConn → 𝐽 ∈ Top)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1530  wcel 2107  wral 3143  wrex 3144   cuni 4837  cfv 6354  (class class class)co 7150  0cc0 10531  1c1 10532  Topctop 21436   Cn ccn 21767  IIcii 23417  PConncpconn 32369
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ral 3148  df-rex 3149  df-rab 3152  df-v 3502  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-nul 4296  df-if 4471  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4838  df-br 5064  df-iota 6313  df-fv 6362  df-ov 7153  df-pconn 32371
This theorem is referenced by:  sconntop  32378  pconnconn  32381  txpconn  32382  ptpconn  32383  qtoppconn  32386  pconnpi1  32387  sconnpi1  32389  cvxsconn  32393
  Copyright terms: Public domain W3C validator