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

Theorem sconpht 28499
Description: A closed path in a simply connected space is contractible to a point. (Contributed by Mario Carneiro, 11-Feb-2015.)
Assertion
Ref Expression
sconpht  |-  ( ( J  e. SCon  /\  F  e.  ( II  Cn  J
)  /\  ( F `  0 )  =  ( F `  1
) )  ->  F
(  ~=ph  `  J )
( ( 0 [,] 1 )  X.  {
( F `  0
) } ) )

Proof of Theorem sconpht
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 isscon 28496 . . . 4  |-  ( J  e. SCon 
<->  ( J  e. PCon  /\  A. f  e.  ( II 
Cn  J ) ( ( f `  0
)  =  ( f `
 1 )  -> 
f (  ~=ph  `  J
) ( ( 0 [,] 1 )  X. 
{ ( f ` 
0 ) } ) ) ) )
21simprbi 464 . . 3  |-  ( J  e. SCon  ->  A. f  e.  ( II  Cn  J ) ( ( f ` 
0 )  =  ( f `  1 )  ->  f (  ~=ph  `  J ) ( ( 0 [,] 1 )  X.  { ( f `
 0 ) } ) ) )
3 fveq1 5871 . . . . . 6  |-  ( f  =  F  ->  (
f `  0 )  =  ( F ` 
0 ) )
4 fveq1 5871 . . . . . 6  |-  ( f  =  F  ->  (
f `  1 )  =  ( F ` 
1 ) )
53, 4eqeq12d 2489 . . . . 5  |-  ( f  =  F  ->  (
( f `  0
)  =  ( f `
 1 )  <->  ( F `  0 )  =  ( F `  1
) ) )
6 id 22 . . . . . 6  |-  ( f  =  F  ->  f  =  F )
73sneqd 4045 . . . . . . 7  |-  ( f  =  F  ->  { ( f `  0 ) }  =  { ( F `  0 ) } )
87xpeq2d 5029 . . . . . 6  |-  ( f  =  F  ->  (
( 0 [,] 1
)  X.  { ( f `  0 ) } )  =  ( ( 0 [,] 1
)  X.  { ( F `  0 ) } ) )
96, 8breq12d 4466 . . . . 5  |-  ( f  =  F  ->  (
f (  ~=ph  `  J
) ( ( 0 [,] 1 )  X. 
{ ( f ` 
0 ) } )  <-> 
F (  ~=ph  `  J
) ( ( 0 [,] 1 )  X. 
{ ( F ` 
0 ) } ) ) )
105, 9imbi12d 320 . . . 4  |-  ( f  =  F  ->  (
( ( f ` 
0 )  =  ( f `  1 )  ->  f (  ~=ph  `  J ) ( ( 0 [,] 1 )  X.  { ( f `
 0 ) } ) )  <->  ( ( F `  0 )  =  ( F ` 
1 )  ->  F
(  ~=ph  `  J )
( ( 0 [,] 1 )  X.  {
( F `  0
) } ) ) ) )
1110rspccv 3216 . . 3  |-  ( A. f  e.  ( II  Cn  J ) ( ( f `  0 )  =  ( f ` 
1 )  ->  f
(  ~=ph  `  J )
( ( 0 [,] 1 )  X.  {
( f `  0
) } ) )  ->  ( F  e.  ( II  Cn  J
)  ->  ( ( F `  0 )  =  ( F ` 
1 )  ->  F
(  ~=ph  `  J )
( ( 0 [,] 1 )  X.  {
( F `  0
) } ) ) ) )
122, 11syl 16 . 2  |-  ( J  e. SCon  ->  ( F  e.  ( II  Cn  J
)  ->  ( ( F `  0 )  =  ( F ` 
1 )  ->  F
(  ~=ph  `  J )
( ( 0 [,] 1 )  X.  {
( F `  0
) } ) ) ) )
13123imp 1190 1  |-  ( ( J  e. SCon  /\  F  e.  ( II  Cn  J
)  /\  ( F `  0 )  =  ( F `  1
) )  ->  F
(  ~=ph  `  J )
( ( 0 [,] 1 )  X.  {
( F `  0
) } ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ w3a 973    = wceq 1379    e. wcel 1767   A.wral 2817   {csn 4033   class class class wbr 4453    X. cxp 5003   ` cfv 5594  (class class class)co 6295   0cc0 9504   1c1 9505   [,]cicc 11544    Cn ccn 19593   IIcii 21247    ~=ph cphtpc 21337  PConcpcon 28489  SConcscon 28490
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ral 2822  df-rex 2823  df-rab 2826  df-v 3120  df-dif 3484  df-un 3486  df-in 3488  df-ss 3495  df-nul 3791  df-if 3946  df-sn 4034  df-pr 4036  df-op 4040  df-uni 4252  df-br 4454  df-opab 4512  df-xp 5011  df-iota 5557  df-fv 5602  df-ov 6298  df-scon 28492
This theorem is referenced by:  sconpht2  28508  sconpi1  28509  txscon  28511
  Copyright terms: Public domain W3C validator