| 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 25132 | . . . . 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 25132 | . . . . 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 25155 | . 2 ⊢ (𝜑 → (𝐹(*𝑝‘𝐽)𝐺) ∈ (II Cn 𝐽)) |
| 11 | 3 | simp2d 1159 | . . 3 ⊢ (𝜑 → 𝐻 ∈ (II Cn 𝐽)) |
| 12 | 7 | simp2d 1159 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (II Cn 𝐽)) |
| 13 | phtpc01 25134 | . . . . . 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 25134 | . . . . . 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 2804 | . . 3 ⊢ (𝜑 → (𝐻‘1) = (𝐾‘0)) |
| 20 | 11, 12, 19 | pcocn 25155 | . 2 ⊢ (𝜑 → (𝐻(*𝑝‘𝐽)𝐾) ∈ (II Cn 𝐽)) |
| 21 | 3 | simp3d 1160 | . . . . 5 ⊢ (𝜑 → (𝐹(PHtpy‘𝐽)𝐻) ≠ ∅) |
| 22 | n0 4306 | . . . . 5 ⊢ ((𝐹(PHtpy‘𝐽)𝐻) ≠ ∅ ↔ ∃𝑚 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻)) | |
| 23 | 21, 22 | sylib 221 | . . . 4 ⊢ (𝜑 → ∃𝑚 𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻)) |
| 24 | 7 | simp3d 1160 | . . . . 5 ⊢ (𝜑 → (𝐺(PHtpy‘𝐽)𝐾) ≠ ∅) |
| 25 | n0 4306 | . . . . 5 ⊢ ((𝐺(PHtpy‘𝐽)𝐾) ≠ ∅ ↔ ∃𝑛 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) | |
| 26 | 24, 25 | sylib 221 | . . . 4 ⊢ (𝜑 → ∃𝑛 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) |
| 27 | exdistrv 1983 | . . . 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 2761 | . . . . . . 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 25157 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), ((2 · 𝑥)𝑚𝑦), (((2 · 𝑥) − 1)𝑛𝑦))) ∈ ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾))) |
| 36 | 35 | ne0d 4294 | . . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾))) → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅) |
| 37 | 36 | ex 417 | . . . 4 ⊢ (𝜑 → ((𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅)) |
| 38 | 37 | exlimdvv 1962 | . . 3 ⊢ (𝜑 → (∃𝑚∃𝑛(𝑚 ∈ (𝐹(PHtpy‘𝐽)𝐻) ∧ 𝑛 ∈ (𝐺(PHtpy‘𝐽)𝐾)) → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅)) |
| 39 | 28, 38 | mpd 16 | . 2 ⊢ (𝜑 → ((𝐹(*𝑝‘𝐽)𝐺)(PHtpy‘𝐽)(𝐻(*𝑝‘𝐽)𝐾)) ≠ ∅) |
| 40 | isphtpc 25132 | . 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 1568 ∃wex 1807 ∈ wcel 2141 ≠ wne 2956 ∅c0 4285 ifcif 4486 class class class wbr 5108 ‘cfv 6536 (class class class)co 7410 ∈ cmpo 7412 0cc0 11099 1c1 11100 · cmul 11104 ≤ cle 11243 − cmin 11440 / cdiv 11870 2c2 12294 [,]cicc 13374 Cn ccn 23360 IIcii 25013 PHtpycphtpy 25106 ≃phcphtpc 25107 *𝑝cpco 25138 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-iin 4958 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7674 df-om 7862 df-1st 7985 df-2nd 7986 df-supp 8156 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-er 8693 df-map 8825 df-ixp 8895 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-fsupp 9321 df-fi 9370 df-sup 9401 df-inf 9402 df-oi 9471 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-4 12304 df-5 12305 df-6 12306 df-7 12307 df-8 12308 df-9 12309 df-n0 12504 df-z 12591 df-dec 12711 df-uz 12862 df-q 12972 df-rp 13016 df-xneg 13136 df-xadd 13137 df-xmul 13138 df-ioo 13375 df-icc 13378 df-fz 13535 df-fzo 13682 df-seq 14037 df-exp 14097 df-hash 14366 df-cj 15149 df-re 15150 df-im 15151 df-sqrt 15285 df-abs 15286 df-struct 17206 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-mulr 17323 df-starv 17324 df-sca 17325 df-vsca 17326 df-ip 17327 df-tset 17328 df-ple 17329 df-ds 17331 df-unif 17332 df-hom 17333 df-cco 17334 df-rest 17474 df-topn 17475 df-0g 17493 df-gsum 17494 df-topgen 17495 df-pt 17496 df-prds 17499 df-xrs 17555 df-qtop 17560 df-imas 17561 df-xps 17563 df-mre 17637 df-mrc 17638 df-acs 17640 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-submnd 18841 df-mulg 19133 df-cntz 19386 df-cmn 19851 df-psmet 21493 df-xmet 21494 df-met 21495 df-bl 21496 df-mopn 21497 df-cnfld 21502 df-top 23030 df-topon 23047 df-topsp 23069 df-bases 23082 df-cld 23155 df-cn 23363 df-cnp 23364 df-tx 23698 df-hmeo 23891 df-xms 24456 df-ms 24457 df-tms 24458 df-ii 25015 df-htpy 25108 df-phtpy 25109 df-phtpc 25130 df-pco 25143 |
| This theorem is referenced by: pcophtb 25167 pi1cpbl 25182 pi1xfrf 25191 pi1xfr 25193 pi1xfrcnvlem 25194 |
| Copyright terms: Public domain | W3C validator |