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 35469
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 7368 . . 3 (𝑗 = 𝐽 → (II Cn 𝑗) = (II Cn 𝐽))
2 fveq2 6831 . . . . 5 (𝑗 = 𝐽 → ( ≃ph𝑗) = ( ≃ph𝐽))
32breqd 5086 . . . 4 (𝑗 = 𝐽 → (𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)}) ↔ 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)})))
43imbi2d 342 . . 3 (𝑗 = 𝐽 → (((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)})) ↔ ((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)}))))
51, 4raleqbidv 3315 . 2 (𝑗 = 𝐽 → (∀𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)})) ↔ ∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)}))))
6 df-sconn 35465 . 2 SConn = {𝑗 ∈ PConn ∣ ∀𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)}))}
75, 6elrab2 3634 1 (𝐽 ∈ SConn ↔ (𝐽 ∈ PConn ∧ ∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)}))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397   = wceq 1548  wcel 2121  wral 3055  {csn 4558   class class class wbr 5075   × cxp 5619  cfv 6489  (class class class)co 7360  0cc0 11033  1c1 11034  [,]cicc 13296   Cn ccn 23211  IIcii 24864  phcphtpc 24958  PConncpconn 35462  SConncsconn 35463
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-iota 6445  df-fv 6497  df-ov 7363  df-sconn 35465
This theorem is referenced by:  sconnpconn  35470  sconnpht  35472  sconnpi1  35482  txsconn  35484  cvxsconn  35486
  Copyright terms: Public domain W3C validator