Theorem sconnpconn 35397

Description: A simply connected space is path-connected. (Contributed by Mario Carneiro, 11-Feb-2015.)

Assertion

Ref	Expression
sconnpconn	⊢ (𝐽 ∈ SConn → 𝐽 ∈ PConn)

Proof of Theorem sconnpconn

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		issconn 35396	. 2 ⊢ (𝐽 ∈ SConn ↔ (𝐽 ∈ PConn ∧ ∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘𝐽)((0[,]1) × {(𝑓‘0)}))))
2	1	simplbi 496	1 ⊢ (𝐽 ∈ SConn → 𝐽 ∈ PConn)

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  ∀wral 3049  {csn 4557   class class class wbr 5074   × cxp 5618  ‘cfv 6487  (class class class)co 7356  0cc0 11027  1c1 11028  [,]cicc 13290   Cn ccn 23177  IIcii 24830   ≃_phcphtpc 24924  PConncpconn 35389  SConncsconn 35390

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-ext 2707

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-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-ral 3050  df-rab 3388  df-v 3429  df-dif 3888  df-un 3890  df-ss 3902  df-nul 4264  df-if 4457  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-br 5075  df-iota 6443  df-fv 6495  df-ov 7359  df-sconn 35392

This theorem is referenced by:  sconntop  35398  txsconn  35411  resconn  35416  iinllyconn  35424  cvmlift2lem10  35482  cvmlift3lem2  35490  cvmlift3  35498