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

Theorem issconn 35369
Description: The property of being a simply connected topological space. (Contributed by Mario Carneiro, 11-Feb-2015.)
Assertion
Ref Expression
issconn (𝐽 ∈ SConn ↔ (𝐽 ∈ PConn ∧ ∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)}))))
Distinct variable group:   𝑓,𝐽

Proof of Theorem issconn
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 oveq2 7364 . . 3 (𝑗 = 𝐽 → (II Cn 𝑗) = (II Cn 𝐽))
2 fveq2 6832 . . . . 5 (𝑗 = 𝐽 → ( ≃ph𝑗) = ( ≃ph𝐽))
32breqd 5107 . . . 4 (𝑗 = 𝐽 → (𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)}) ↔ 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)})))
43imbi2d 340 . . 3 (𝑗 = 𝐽 → (((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)})) ↔ ((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)}))))
51, 4raleqbidv 3314 . 2 (𝑗 = 𝐽 → (∀𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)})) ↔ ∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)}))))
6 df-sconn 35365 . 2 SConn = {𝑗 ∈ PConn ∣ ∀𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)}))}
75, 6elrab2 3647 1 (𝐽 ∈ SConn ↔ (𝐽 ∈ PConn ∧ ∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)}))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3049  {csn 4578   class class class wbr 5096   × cxp 5620  cfv 6490  (class class class)co 7356  0cc0 11024  1c1 11025  [,]cicc 13262   Cn ccn 23166  IIcii 24822  phcphtpc 24922  PConncpconn 35362  SConncsconn 35363
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ral 3050  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-iota 6446  df-fv 6498  df-ov 7359  df-sconn 35365
This theorem is referenced by:  sconnpconn  35370  sconnpht  35372  sconnpi1  35382  txsconn  35384  cvxsconn  35386
  Copyright terms: Public domain W3C validator