| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pcohtpy | Structured version Visualization version GIF version | ||
| Description: Homotopy invariance of path concatenation. (Contributed by Jeff Madsen, 15-Jun-2010.) (Revised by Mario Carneiro, 24-Feb-2015.) |
| Ref | Expression |
|---|---|
| pcohtpy.4 | ⊢ (𝜑 → (𝐹‘1) = (𝐺‘0)) |
| pcohtpy.5 | ⊢ (𝜑 → 𝐹( ≃ph‘𝐽)𝐻) |
| pcohtpy.6 | ⊢ (𝜑 → 𝐺( ≃ph‘𝐽)𝐾) |
| Ref | Expression |
|---|---|
| pcohtpy | ⊢ (𝜑 → (𝐹(*𝑝‘𝐽)𝐺)( ≃ph‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pcohtpy.5 | . . . . 5 ⊢ (𝜑 → 𝐹( ≃ph‘𝐽)𝐻) | |
| 2 | isphtpc 25026 | . . . . 5 ⊢ (𝐹( ≃ph‘𝐽)𝐻 ↔ (𝐹 ∈ (II Cn 𝐽) ∧ 𝐻 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐻) ≠ ∅)) | |
| 3 | 1, 2 | sylib 218 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ (II Cn 𝐽) ∧ 𝐻 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐻) ≠ ∅)) |
| 4 | 3 | simp1d 1143 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (II Cn 𝐽)) |
| 5 | pcohtpy.6 | . . . . 5 ⊢ (𝜑 → 𝐺( ≃ph‘𝐽)𝐾) | |
| 6 | isphtpc 25026 | . . . . 5 ⊢ (𝐺( ≃ph‘𝐽)𝐾 ↔ (𝐺 ∈ (II Cn 𝐽) ∧ 𝐾 ∈ (II Cn 𝐽) ∧ (𝐺(PHtpy‘𝐽)𝐾) ≠ ∅)) | |
| 7 | 5, 6 | sylib 218 | . . . 4 ⊢ (𝜑 → (𝐺 ∈ (II Cn 𝐽) ∧ 𝐾 ∈ (II Cn 𝐽) ∧ (𝐺(PHtpy‘𝐽)𝐾) ≠ ∅)) |
| 8 | 7 | simp1d 1143 | . . 3 ⊢ (𝜑 → 𝐺 ∈ (II Cn 𝐽)) |
| 9 | pcohtpy.4 | . . 3 ⊢ (𝜑 → (𝐹‘1) = (𝐺‘0)) | |
| 10 | 4, 8, 9 | pcocn 25050 | . 2 ⊢ (𝜑 → (𝐹(*𝑝‘𝐽)𝐺) ∈ (II Cn 𝐽)) |
| 11 | 3 | simp2d 1144 | . . 3 ⊢ (𝜑 → 𝐻 ∈ (II Cn 𝐽)) |
| 12 | 7 | simp2d 1144 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (II Cn 𝐽)) |
| 13 | phtpc01 25028 | . . . . . 6 ⊢ (𝐹( ≃ph‘𝐽)𝐻 → ((𝐹‘0) = (𝐻‘0) ∧ (𝐹‘1) = (𝐻‘1))) | |
| 14 | 1, 13 | syl 17 | . . . . 5 ⊢ (𝜑 → ((𝐹‘0) = (𝐻‘0) ∧ (𝐹‘1) = (𝐻‘1))) |
| 15 | 14 | simprd 495 | . . . 4 ⊢ (𝜑 → (𝐹‘1) = (𝐻‘1)) |
| 16 | phtpc01 25028 | . . . . . 6 ⊢ (𝐺( ≃ph‘𝐽)𝐾 → ((𝐺‘0) = (𝐾‘0) ∧ (𝐺‘1) = (𝐾‘1))) | |
| 17 | 5, 16 | syl 17 | . . . . 5 ⊢ (𝜑 → ((𝐺‘0) = (𝐾‘0) ∧ (𝐺‘1) = (𝐾‘1))) |
| 18 | 17 | simpld 494 | . . . 4 ⊢ (𝜑 → (𝐺‘0) = (𝐾‘0)) |
| 19 | 9, 15, 18 | 3eqtr3d 2785 | . . 3 ⊢ (𝜑 → (𝐻‘1) = (𝐾‘0)) |
| 20 | 11, 12, 19 | pcocn 25050 | . 2 ⊢ (𝜑 → (𝐻(*𝑝‘𝐽)𝐾) ∈ (II Cn 𝐽)) |
| 21 | 3 | simp3d 1145 | . . . . 5 ⊢ (𝜑 → (𝐹(PHtpy‘𝐽)𝐻) ≠ ∅) |
| 22 | n0 4353 | . . . . 5 ⊢ ((𝐹(PHtpy‘𝐽)𝐻) ≠ ∅ ↔ ∃𝑚 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻)) | |
| 23 | 21, 22 | sylib 218 | . . . 4 ⊢ (𝜑 → ∃𝑚 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻)) |
| 24 | 7 | simp3d 1145 | . . . . 5 ⊢ (𝜑 → (𝐺(PHtpy‘𝐽)𝐾) ≠ ∅) |
| 25 | n0 4353 | . . . . 5 ⊢ ((𝐺(PHtpy‘𝐽)𝐾) ≠ ∅ ↔ ∃𝑛 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) | |
| 26 | 24, 25 | sylib 218 | . . . 4 ⊢ (𝜑 → ∃𝑛 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) |
| 27 | exdistrv 1955 | . . . 4 ⊢ (∃𝑚∃𝑛(𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) ↔ (∃𝑚 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ ∃𝑛 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) | |
| 28 | 23, 26, 27 | sylanbrc 583 | . . 3 ⊢ (𝜑 → ∃𝑚∃𝑛(𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) |
| 29 | 9 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → (𝐹‘1) = (𝐺‘0)) |
| 30 | 1 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → 𝐹( ≃ph‘𝐽)𝐻) |
| 31 | 5 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → 𝐺( ≃ph‘𝐽)𝐾) |
| 32 | eqid 2737 | . . . . . . 7 ⊢ (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), ((2 · 𝑥)𝑚𝑦), (((2 · 𝑥) − 1)𝑛𝑦))) = (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), ((2 · 𝑥)𝑚𝑦), (((2 · 𝑥) − 1)𝑛𝑦))) | |
| 33 | simprl 771 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻)) | |
| 34 | simprr 773 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) | |
| 35 | 29, 30, 31, 32, 33, 34 | pcohtpylem 25052 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), ((2 · 𝑥)𝑚𝑦), (((2 · 𝑥) − 1)𝑛𝑦))) ∈ ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾))) |
| 36 | 35 | ne0d 4342 | . . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅) |
| 37 | 36 | ex 412 | . . . 4 ⊢ (𝜑 → ((𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅)) |
| 38 | 37 | exlimdvv 1934 | . . 3 ⊢ (𝜑 → (∃𝑚∃𝑛(𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅)) |
| 39 | 28, 38 | mpd 15 | . 2 ⊢ (𝜑 → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅) |
| 40 | isphtpc 25026 | . 2 ⊢ ((𝐹(*𝑝‘𝐽)𝐺)( ≃ph‘𝐽)(𝐻(*𝑝‘𝐽)𝐾) ↔ ((𝐹(*𝑝‘𝐽)𝐺) ∈ (II Cn 𝐽) ∧ (𝐻(*𝑝‘𝐽)𝐾) ∈ (II Cn 𝐽) ∧ ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅)) | |
| 41 | 10, 20, 39, 40 | syl3anbrc 1344 | 1 ⊢ (𝜑 → (𝐹(*𝑝‘𝐽)𝐺)( ≃ph‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∃wex 1779 ∈ wcel 2108 ≠ wne 2940 ∅c0 4333 ifcif 4525 class class class wbr 5143 ‘cfv 6561 (class class class)co 7431 ∈ cmpo 7433 0cc0 11155 1c1 11156 · cmul 11160 ≤ cle 11296 − cmin 11492 / cdiv 11920 2c2 12321 [,]cicc 13390 Cn ccn 23232 IIcii 24901 PHtpycphtpy 25000 ≃phcphtpc 25001 *𝑝cpco 25033 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 ax-pre-sup 11233 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-tp 4631 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-iin 4994 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-se 5638 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 df-om 7888 df-1st 8014 df-2nd 8015 df-supp 8186 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-2o 8507 df-er 8745 df-map 8868 df-ixp 8938 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-fsupp 9402 df-fi 9451 df-sup 9482 df-inf 9483 df-oi 9550 df-card 9979 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-div 11921 df-nn 12267 df-2 12329 df-3 12330 df-4 12331 df-5 12332 df-6 12333 df-7 12334 df-8 12335 df-9 12336 df-n0 12527 df-z 12614 df-dec 12734 df-uz 12879 df-q 12991 df-rp 13035 df-xneg 13154 df-xadd 13155 df-xmul 13156 df-ioo 13391 df-icc 13394 df-fz 13548 df-fzo 13695 df-seq 14043 df-exp 14103 df-hash 14370 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275 df-struct 17184 df-sets 17201 df-slot 17219 df-ndx 17231 df-base 17248 df-ress 17275 df-plusg 17310 df-mulr 17311 df-starv 17312 df-sca 17313 df-vsca 17314 df-ip 17315 df-tset 17316 df-ple 17317 df-ds 17319 df-unif 17320 df-hom 17321 df-cco 17322 df-rest 17467 df-topn 17468 df-0g 17486 df-gsum 17487 df-topgen 17488 df-pt 17489 df-prds 17492 df-xrs 17547 df-qtop 17552 df-imas 17553 df-xps 17555 df-mre 17629 df-mrc 17630 df-acs 17632 df-mgm 18653 df-sgrp 18732 df-mnd 18748 df-submnd 18797 df-mulg 19086 df-cntz 19335 df-cmn 19800 df-psmet 21356 df-xmet 21357 df-met 21358 df-bl 21359 df-mopn 21360 df-cnfld 21365 df-top 22900 df-topon 22917 df-topsp 22939 df-bases 22953 df-cld 23027 df-cn 23235 df-cnp 23236 df-tx 23570 df-hmeo 23763 df-xms 24330 df-ms 24331 df-tms 24332 df-ii 24903 df-htpy 25002 df-phtpy 25003 df-phtpc 25024 df-pco 25038 |
| This theorem is referenced by: pcophtb 25062 pi1cpbl 25077 pi1xfrf 25086 pi1xfr 25088 pi1xfrcnvlem 25089 |
| Copyright terms: Public domain | W3C validator |