| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > htpyi | Structured version Visualization version GIF version | ||
| Description: A homotopy evaluated at its endpoints. (Contributed by Mario Carneiro, 22-Feb-2015.) |
| Ref | Expression |
|---|---|
| ishtpy.1 | ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) |
| ishtpy.3 | ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) |
| ishtpy.4 | ⊢ (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾)) |
| htpyi.1 | ⊢ (𝜑 → 𝐻 ∈ (𝐹(𝐽 Htpy 𝐾)𝐺)) |
| Ref | Expression |
|---|---|
| htpyi | ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑋) → ((𝐴𝐻0) = (𝐹‘𝐴) ∧ (𝐴𝐻1) = (𝐺‘𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | htpyi.1 | . . . 4 ⊢ (𝜑 → 𝐻 ∈ (𝐹(𝐽 Htpy 𝐾)𝐺)) | |
| 2 | ishtpy.1 | . . . . 5 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) | |
| 3 | ishtpy.3 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) | |
| 4 | ishtpy.4 | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾)) | |
| 5 | 2, 3, 4 | ishtpy 25168 | . . . 4 ⊢ (𝜑 → (𝐻 ∈ (𝐹(𝐽 Htpy 𝐾)𝐺) ↔ (𝐻 ∈ ((𝐽 ×t II) Cn 𝐾) ∧ ∀𝑠 ∈ 𝑋 ((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠))))) |
| 6 | 1, 5 | mpbid 235 | . . 3 ⊢ (𝜑 → (𝐻 ∈ ((𝐽 ×t II) Cn 𝐾) ∧ ∀𝑠 ∈ 𝑋 ((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠)))) |
| 7 | 6 | simprd 501 | . 2 ⊢ (𝜑 → ∀𝑠 ∈ 𝑋 ((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠))) |
| 8 | oveq1 7430 | . . . . 5 ⊢ (𝑠 = 𝐴 → (𝑠𝐻0) = (𝐴𝐻0)) | |
| 9 | fveq2 6888 | . . . . 5 ⊢ (𝑠 = 𝐴 → (𝐹‘𝑠) = (𝐹‘𝐴)) | |
| 10 | 8, 9 | eqeq12d 2782 | . . . 4 ⊢ (𝑠 = 𝐴 → ((𝑠𝐻0) = (𝐹‘𝑠) ↔ (𝐴𝐻0) = (𝐹‘𝐴))) |
| 11 | oveq1 7430 | . . . . 5 ⊢ (𝑠 = 𝐴 → (𝑠𝐻1) = (𝐴𝐻1)) | |
| 12 | fveq2 6888 | . . . . 5 ⊢ (𝑠 = 𝐴 → (𝐺‘𝑠) = (𝐺‘𝐴)) | |
| 13 | 11, 12 | eqeq12d 2782 | . . . 4 ⊢ (𝑠 = 𝐴 → ((𝑠𝐻1) = (𝐺‘𝑠) ↔ (𝐴𝐻1) = (𝐺‘𝐴))) |
| 14 | 10, 13 | anbi12d 644 | . . 3 ⊢ (𝑠 = 𝐴 → (((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠)) ↔ ((𝐴𝐻0) = (𝐹‘𝐴) ∧ (𝐴𝐻1) = (𝐺‘𝐴)))) |
| 15 | 14 | rspccva 3583 | . 2 ⊢ ((∀𝑠 ∈ 𝑋 ((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠)) ∧ 𝐴 ∈ 𝑋) → ((𝐴𝐻0) = (𝐹‘𝐴) ∧ (𝐴𝐻1) = (𝐺‘𝐴))) |
| 16 | 7, 15 | sylan 592 | 1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑋) → ((𝐴𝐻0) = (𝐹‘𝐴) ∧ (𝐴𝐻1) = (𝐺‘𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3082 ‘cfv 6543 (class class class)co 7423 0cc0 11118 1c1 11119 TopOnctopon 23104 Cn ccn 23418 ×t ctx 23754 IIcii 25071 Htpy chtpy 25163 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| 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-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-ov 7426 df-oprab 7427 df-mpo 7428 df-1st 7995 df-2nd 7996 df-map 8835 df-top 23088 df-topon 23105 df-cn 23421 df-htpy 25166 |
| This theorem is used by: htpycom 25172 htpyco1 25174 htpyco2 25175 htpycc 25176 phtpy01 25181 pcohtpylem 25215 txsconnlem 35753 cvmliftphtlem 35830 |
| Copyright terms: Public domain | W3C validator |