![]() |
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 25023 | . . . 4 ⊢ (𝜑 → (𝐻 ∈ (𝐹(𝐽 Htpy 𝐾)𝐺) ↔ (𝐻 ∈ ((𝐽 ×t II) Cn 𝐾) ∧ ∀𝑠 ∈ 𝑋 ((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠))))) |
6 | 1, 5 | mpbid 232 | . . 3 ⊢ (𝜑 → (𝐻 ∈ ((𝐽 ×t II) Cn 𝐾) ∧ ∀𝑠 ∈ 𝑋 ((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠)))) |
7 | 6 | simprd 495 | . 2 ⊢ (𝜑 → ∀𝑠 ∈ 𝑋 ((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠))) |
8 | oveq1 7455 | . . . . 5 ⊢ (𝑠 = 𝐴 → (𝑠𝐻0) = (𝐴𝐻0)) | |
9 | fveq2 6920 | . . . . 5 ⊢ (𝑠 = 𝐴 → (𝐹‘𝑠) = (𝐹‘𝐴)) | |
10 | 8, 9 | eqeq12d 2756 | . . . 4 ⊢ (𝑠 = 𝐴 → ((𝑠𝐻0) = (𝐹‘𝑠) ↔ (𝐴𝐻0) = (𝐹‘𝐴))) |
11 | oveq1 7455 | . . . . 5 ⊢ (𝑠 = 𝐴 → (𝑠𝐻1) = (𝐴𝐻1)) | |
12 | fveq2 6920 | . . . . 5 ⊢ (𝑠 = 𝐴 → (𝐺‘𝑠) = (𝐺‘𝐴)) | |
13 | 11, 12 | eqeq12d 2756 | . . . 4 ⊢ (𝑠 = 𝐴 → ((𝑠𝐻1) = (𝐺‘𝑠) ↔ (𝐴𝐻1) = (𝐺‘𝐴))) |
14 | 10, 13 | anbi12d 631 | . . 3 ⊢ (𝑠 = 𝐴 → (((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠)) ↔ ((𝐴𝐻0) = (𝐹‘𝐴) ∧ (𝐴𝐻1) = (𝐺‘𝐴)))) |
15 | 14 | rspccva 3634 | . 2 ⊢ ((∀𝑠 ∈ 𝑋 ((𝑠𝐻0) = (𝐹‘𝑠) ∧ (𝑠𝐻1) = (𝐺‘𝑠)) ∧ 𝐴 ∈ 𝑋) → ((𝐴𝐻0) = (𝐹‘𝐴) ∧ (𝐴𝐻1) = (𝐺‘𝐴))) |
16 | 7, 15 | sylan 579 | 1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑋) → ((𝐴𝐻0) = (𝐹‘𝐴) ∧ (𝐴𝐻1) = (𝐺‘𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∀wral 3067 ‘cfv 6573 (class class class)co 7448 0cc0 11184 1c1 11185 TopOnctopon 22937 Cn ccn 23253 ×t ctx 23589 IIcii 24920 Htpy chtpy 25018 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-1st 8030 df-2nd 8031 df-map 8886 df-top 22921 df-topon 22938 df-cn 23256 df-htpy 25021 |
This theorem is referenced by: htpycom 25027 htpyco1 25029 htpyco2 25030 htpycc 25031 phtpy01 25036 pcohtpylem 25071 txsconnlem 35208 cvmliftphtlem 35285 |
Copyright terms: Public domain | W3C validator |