Theorem issconn 31208

Description: The property of being a simply connected topological space. (Contributed by Mario Carneiro, 11-Feb-2015.)

Assertion

Ref	Expression
issconn	|- ( J e. SConn <-> ( J e. PConn /\ A. f e. ( II Cn J ) ( ( f ` 0 ) = ( f ` 1 ) -> f ( ~=ph ` J ) ( ( 0 [,] 1 ) X. { ( f ` 0 ) } ) ) ) )

Distinct variable group:   f, J

Proof of Theorem issconn

Dummy variable j is distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 6658	. . 3 |- ( j = J -> ( II Cn j ) = ( II Cn J ) )
2		fveq2 6191	. . . . 5 |- ( j = J -> ( ~=ph ` j ) = ( ~=ph ` J ) )
3	2	breqd 4664	. . . 4 |- ( j = J -> ( f ( ~=ph ` j ) ( ( 0 [,] 1 ) X. { ( f ` 0 ) } ) <-> f ( ~=ph ` J ) ( ( 0 [,] 1 ) X. { ( f ` 0 ) } ) ) )
4	3	imbi2d 330	. . 3 |- ( j = J -> ( ( ( f ` 0 ) = ( f ` 1 ) -> f ( ~=ph ` j ) ( ( 0 [,] 1 ) X. { ( f ` 0 ) } ) ) <-> ( ( f ` 0 ) = ( f ` 1 ) -> f ( ~=ph ` J ) ( ( 0 [,] 1 ) X. { ( f ` 0 ) } ) ) ) )
5	1, 4	raleqbidv 3152	. 2 |- ( j = J -> ( A. f e. ( II Cn j ) ( ( f ` 0 ) = ( f ` 1 ) -> f ( ~=ph ` j ) ( ( 0 [,] 1 ) X. { ( f ` 0 ) } ) ) <-> A. f e. ( II Cn J ) ( ( f ` 0 ) = ( f ` 1 ) -> f ( ~=ph ` J ) ( ( 0 [,] 1 ) X. { ( f ` 0 ) } ) ) ) )
6		df-sconn 31204	. 2 |- SConn = { j e. PConn | A. f e. ( II Cn j ) ( ( f ` 0 ) = ( f ` 1 ) -> f ( ~=ph ` j ) ( ( 0 [,] 1 ) X. { ( f ` 0 ) } ) ) }
7	5, 6	elrab2 3366	1 |- ( J e. SConn <-> ( J e. PConn /\ A. f e. ( II Cn J ) ( ( f ` 0 ) = ( f ` 1 ) -> f ( ~=ph ` J ) ( ( 0 [,] 1 ) X. { ( f ` 0 ) } ) ) ) )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   = wceq 1483   e. wcel 1990   A.wral 2912   {csn 4177   class class class wbr 4653   X. cxp 5112   ` cfv 5888  (class class class)co 6650   0cc0 9936   1c1 9937   [,]cicc 12178   Cn ccn 21028   IIcii 22678   ~=ph cphtpc 22768  PConncpconn 31201  SConncsconn 31202

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653  df-sconn 31204

This theorem is referenced by:  sconnpconn  31209  sconnpht  31211  sconnpi1  31221  txsconn  31223  cvxsconn  31225