| Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sconnpht | Structured version Visualization version GIF version | ||
| Description: A closed path in a simply connected space is contractible to a point. (Contributed by Mario Carneiro, 11-Feb-2015.) |
| Ref | Expression |
|---|---|
| sconnpht | ⊢ ((𝐽 ∈ SConn ∧ 𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = (𝐹‘1)) → 𝐹( ≃ph‘𝐽)((0[,]1) × {(𝐹‘0)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | issconn 36199 | . . 3 ⊢ (𝐽 ∈ SConn ↔ (𝐽 ∈ PConn ∧ ∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘𝐽)((0[,]1) × {(𝑓‘0)})))) | |
| 2 | fveq1 6915 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘0) = (𝐹‘0)) | |
| 3 | fveq1 6915 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘1) = (𝐹‘1)) | |
| 4 | 2, 3 | eqeq12d 2779 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓‘0) = (𝑓‘1) ↔ (𝐹‘0) = (𝐹‘1))) |
| 5 | id 23 | . . . . . 6 ⊢ (𝑓 = 𝐹 → 𝑓 = 𝐹) | |
| 6 | 2 | sneqd 4596 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → {(𝑓‘0)} = {(𝐹‘0)}) |
| 7 | 6 | xpeq2d 5688 | . . . . . 6 ⊢ (𝑓 = 𝐹 → ((0[,]1) × {(𝑓‘0)}) = ((0[,]1) × {(𝐹‘0)})) |
| 8 | 5, 7 | breq12d 5121 | . . . . 5 ⊢ (𝑓 = 𝐹 → (𝑓( ≃ph‘𝐽)((0[,]1) × {(𝑓‘0)}) ↔ 𝐹( ≃ph‘𝐽)((0[,]1) × {(𝐹‘0)}))) |
| 9 | 4, 8 | imbi12d 347 | . . . 4 ⊢ (𝑓 = 𝐹 → (((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘𝐽)((0[,]1) × {(𝑓‘0)})) ↔ ((𝐹‘0) = (𝐹‘1) → 𝐹( ≃ph‘𝐽)((0[,]1) × {(𝐹‘0)})))) |
| 10 | 9 | rspccv 3577 | . . 3 ⊢ (∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘𝐽)((0[,]1) × {(𝑓‘0)})) → (𝐹 ∈ (II Cn 𝐽) → ((𝐹‘0) = (𝐹‘1) → 𝐹( ≃ph‘𝐽)((0[,]1) × {(𝐹‘0)})))) |
| 11 | 1, 10 | simplbiim 514 | . 2 ⊢ (𝐽 ∈ SConn → (𝐹 ∈ (II Cn 𝐽) → ((𝐹‘0) = (𝐹‘1) → 𝐹( ≃ph‘𝐽)((0[,]1) × {(𝐹‘0)})))) |
| 12 | 11 | 3imp 1128 | 1 ⊢ ((𝐽 ∈ SConn ∧ 𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = (𝐹‘1)) → 𝐹( ≃ph‘𝐽)((0[,]1) × {(𝐹‘0)})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 {csn 4588 class class class wbr 5108 × cxp 5656 ‘cfv 6566 (class class class)co 7451 0cc0 11239 1c1 11240 [,]cicc 13519 Cn ccn 23597 IIcii 25251 ≃phcphtpc 25345 PConncpconn 36192 SConncsconn 36193 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-xp 5664 df-iota 6520 df-fv 6574 df-ov 7454 df-sconn 36195 |
| This theorem is used by: sconnpht2 36211 sconnpi1 36212 txsconn 36214 |
| Copyright terms: Public domain | W3C validator |