Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sconpcon Unicode version

Theorem sconpcon 23773
Description: A simply connected space is path-connected. (Contributed by Mario Carneiro, 11-Feb-2015.)
Assertion
Ref Expression
sconpcon  |-  ( J  e. SCon  ->  J  e. PCon )

Proof of Theorem sconpcon
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 isscon 23772 . 2  |-  ( J  e. SCon 
<->  ( J  e. PCon  /\  A. f  e.  ( II 
Cn  J ) ( ( f `  0
)  =  ( f `
 1 )  -> 
f (  ~=ph  `  J
) ( ( 0 [,] 1 )  X. 
{ ( f ` 
0 ) } ) ) ) )
21simplbi 446 1  |-  ( J  e. SCon  ->  J  e. PCon )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1632    e. wcel 1696   A.wral 2556   {csn 3653   class class class wbr 4039    X. cxp 4703   ` cfv 5271  (class class class)co 5874   0cc0 8753   1c1 8754   [,]cicc 10675    Cn ccn 16970   IIcii 18395    ~=ph cphtpc 18483  PConcpcon 23765  SConcscon 23766
This theorem is referenced by:  scontop  23774  txscon  23787  rescon  23792  iinllycon  23800  cvmlift2lem10  23858  cvmlift3lem2  23866  cvmlift3  23874
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-iota 5235  df-fv 5279  df-ov 5877  df-scon 23768
  Copyright terms: Public domain W3C validator