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 35427
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 7369 . . 3 (𝑗 = 𝐽 → (II Cn 𝑗) = (II Cn 𝐽))
2 fveq2 6835 . . . . 5 (𝑗 = 𝐽 → ( ≃ph𝑗) = ( ≃ph𝐽))
32breqd 5097 . . . 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 3312 . 2 (𝑗 = 𝐽 → (∀𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)})) ↔ ∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)}))))
6 df-sconn 35423 . 2 SConn = {𝑗 ∈ PConn ∣ ∀𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)}))}
75, 6elrab2 3638 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 1542  wcel 2114  wral 3052  {csn 4568   class class class wbr 5086   × cxp 5623  cfv 6493  (class class class)co 7361  0cc0 11032  1c1 11033  [,]cicc 13295   Cn ccn 23202  IIcii 24855  phcphtpc 24949  PConncpconn 35420  SConncsconn 35421
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 2709
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 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-iota 6449  df-fv 6501  df-ov 7364  df-sconn 35423
This theorem is referenced by:  sconnpconn  35428  sconnpht  35430  sconnpi1  35440  txsconn  35442  cvxsconn  35444
  Copyright terms: Public domain W3C validator