| 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 25122 | . . . . 5 ⊢ (𝐹( ≃ph‘𝐽)𝐻 ↔ (𝐹 ∈ (II Cn 𝐽) ∧ 𝐻 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐻) ≠ ∅)) | |
| 3 | 1, 2 | sylib 221 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ (II Cn 𝐽) ∧ 𝐻 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐻) ≠ ∅)) |
| 4 | 3 | simp1d 1158 | . . 3 ⊢ (𝜑 → 𝐹 ∈ (II Cn 𝐽)) |
| 5 | pcohtpy.6 | . . . . 5 ⊢ (𝜑 → 𝐺( ≃ph‘𝐽)𝐾) | |
| 6 | isphtpc 25122 | . . . . 5 ⊢ (𝐺( ≃ph‘𝐽)𝐾 ↔ (𝐺 ∈ (II Cn 𝐽) ∧ 𝐾 ∈ (II Cn 𝐽) ∧ (𝐺(PHtpy‘𝐽)𝐾) ≠ ∅)) | |
| 7 | 5, 6 | sylib 221 | . . . 4 ⊢ (𝜑 → (𝐺 ∈ (II Cn 𝐽) ∧ 𝐾 ∈ (II Cn 𝐽) ∧ (𝐺(PHtpy‘𝐽)𝐾) ≠ ∅)) |
| 8 | 7 | simp1d 1158 | . . 3 ⊢ (𝜑 → 𝐺 ∈ (II Cn 𝐽)) |
| 9 | pcohtpy.4 | . . 3 ⊢ (𝜑 → (𝐹‘1) = (𝐺‘0)) | |
| 10 | 4, 8, 9 | pcocn 25145 | . 2 ⊢ (𝜑 → (𝐹(*𝑝‘𝐽)𝐺) ∈ (II Cn 𝐽)) |
| 11 | 3 | simp2d 1159 | . . 3 ⊢ (𝜑 → 𝐻 ∈ (II Cn 𝐽)) |
| 12 | 7 | simp2d 1159 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (II Cn 𝐽)) |
| 13 | phtpc01 25124 | . . . . . 6 ⊢ (𝐹( ≃ph‘𝐽)𝐻 → ((𝐹‘0) = (𝐻‘0) ∧ (𝐹‘1) = (𝐻‘1))) | |
| 14 | 1, 13 | syl 18 | . . . . 5 ⊢ (𝜑 → ((𝐹‘0) = (𝐻‘0) ∧ (𝐹‘1) = (𝐻‘1))) |
| 15 | 14 | simprd 500 | . . . 4 ⊢ (𝜑 → (𝐹‘1) = (𝐻‘1)) |
| 16 | phtpc01 25124 | . . . . . 6 ⊢ (𝐺( ≃ph‘𝐽)𝐾 → ((𝐺‘0) = (𝐾‘0) ∧ (𝐺‘1) = (𝐾‘1))) | |
| 17 | 5, 16 | syl 18 | . . . . 5 ⊢ (𝜑 → ((𝐺‘0) = (𝐾‘0) ∧ (𝐺‘1) = (𝐾‘1))) |
| 18 | 17 | simpld 499 | . . . 4 ⊢ (𝜑 → (𝐺‘0) = (𝐾‘0)) |
| 19 | 9, 15, 18 | 3eqtr3d 2812 | . . 3 ⊢ (𝜑 → (𝐻‘1) = (𝐾‘0)) |
| 20 | 11, 12, 19 | pcocn 25145 | . 2 ⊢ (𝜑 → (𝐻(*𝑝‘𝐽)𝐾) ∈ (II Cn 𝐽)) |
| 21 | 3 | simp3d 1160 | . . . . 5 ⊢ (𝜑 → (𝐹(PHtpy‘𝐽)𝐻) ≠ ∅) |
| 22 | n0 4315 | . . . . 5 ⊢ ((𝐹(PHtpy‘𝐽)𝐻) ≠ ∅ ↔ ∃𝑚 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻)) | |
| 23 | 21, 22 | sylib 221 | . . . 4 ⊢ (𝜑 → ∃𝑚 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻)) |
| 24 | 7 | simp3d 1160 | . . . . 5 ⊢ (𝜑 → (𝐺(PHtpy‘𝐽)𝐾) ≠ ∅) |
| 25 | n0 4315 | . . . . 5 ⊢ ((𝐺(PHtpy‘𝐽)𝐾) ≠ ∅ ↔ ∃𝑛 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) | |
| 26 | 24, 25 | sylib 221 | . . . 4 ⊢ (𝜑 → ∃𝑛 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) |
| 27 | exdistrv 1982 | . . . 4 ⊢ (∃𝑚∃𝑛(𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) ↔ (∃𝑚 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ ∃𝑛 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) | |
| 28 | 23, 26, 27 | sylanbrc 594 | . . 3 ⊢ (𝜑 → ∃𝑚∃𝑛(𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) |
| 29 | 9 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → (𝐹‘1) = (𝐺‘0)) |
| 30 | 1 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → 𝐹( ≃ph‘𝐽)𝐻) |
| 31 | 5 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → 𝐺( ≃ph‘𝐽)𝐾) |
| 32 | eqid 2769 | . . . . . . 7 ⊢ (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), ((2 · 𝑥)𝑚𝑦), (((2 · 𝑥) − 1)𝑛𝑦))) = (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), ((2 · 𝑥)𝑚𝑦), (((2 · 𝑥) − 1)𝑛𝑦))) | |
| 33 | simprl 782 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻)) | |
| 34 | simprr 784 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) | |
| 35 | 29, 30, 31, 32, 33, 34 | pcohtpylem 25147 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), ((2 · 𝑥)𝑚𝑦), (((2 · 𝑥) − 1)𝑛𝑦))) ∈ ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾))) |
| 36 | 35 | ne0d 4303 | . . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅) |
| 37 | 36 | ex 417 | . . . 4 ⊢ (𝜑 → ((𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅)) |
| 38 | 37 | exlimdvv 1961 | . . 3 ⊢ (𝜑 → (∃𝑚∃𝑛(𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅)) |
| 39 | 28, 38 | mpd 16 | . 2 ⊢ (𝜑 → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅) |
| 40 | isphtpc 25122 | . 2 ⊢ ((𝐹(*𝑝‘𝐽)𝐺)( ≃ph‘𝐽)(𝐻(*𝑝‘𝐽)𝐾) ↔ ((𝐹(*𝑝‘𝐽)𝐺) ∈ (II Cn 𝐽) ∧ (𝐻(*𝑝‘𝐽)𝐾) ∈ (II Cn 𝐽) ∧ ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅)) | |
| 41 | 10, 20, 39, 40 | syl3anbrc 1360 | 1 ⊢ (𝜑 → (𝐹(*𝑝‘𝐽)𝐺)( ≃ph‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∃wex 1806 ∈ wcel 2149 ≠ wne 2964 ∅c0 4294 ifcif 4492 class class class wbr 5113 ‘cfv 6537 (class class class)co 7411 ∈ cmpo 7413 0cc0 11100 1c1 11101 · cmul 11105 ≤ cle 11244 − cmin 11441 / cdiv 11871 2c2 12295 [,]cicc 13375 Cn ccn 23350 IIcii 25003 PHtpycphtpy 25096 ≃phcphtpc 25097 *𝑝cpco 25128 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 ax-pre-sup 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7675 df-om 7863 df-1st 7986 df-2nd 7987 df-supp 8157 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-er 8694 df-map 8826 df-ixp 8896 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-fsupp 9322 df-fi 9371 df-sup 9402 df-inf 9403 df-oi 9472 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-uz 12863 df-q 12973 df-rp 13017 df-xneg 13137 df-xadd 13138 df-xmul 13139 df-ioo 13376 df-icc 13379 df-fz 13536 df-fzo 13683 df-seq 14038 df-exp 14098 df-hash 14367 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-mulr 17324 df-starv 17325 df-sca 17326 df-vsca 17327 df-ip 17328 df-tset 17329 df-ple 17330 df-ds 17332 df-unif 17333 df-hom 17334 df-cco 17335 df-rest 17475 df-topn 17476 df-0g 17494 df-gsum 17495 df-topgen 17496 df-pt 17497 df-prds 17500 df-xrs 17556 df-qtop 17561 df-imas 17562 df-xps 17564 df-mre 17638 df-mrc 17639 df-acs 17641 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-submnd 18842 df-mulg 19134 df-cntz 19387 df-cmn 19852 df-psmet 21483 df-xmet 21484 df-met 21485 df-bl 21486 df-mopn 21487 df-cnfld 21492 df-top 23020 df-topon 23037 df-topsp 23059 df-bases 23072 df-cld 23145 df-cn 23353 df-cnp 23354 df-tx 23688 df-hmeo 23881 df-xms 24446 df-ms 24447 df-tms 24448 df-ii 25005 df-htpy 25098 df-phtpy 25099 df-phtpc 25120 df-pco 25133 |
| This theorem is referenced by: pcophtb 25157 pi1cpbl 25172 pi1xfrf 25181 pi1xfr 25183 pi1xfrcnvlem 25184 |
| Copyright terms: Public domain | W3C validator |