htpyco1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > htpyco1		Structured version Visualization version GIF version

Theorem htpyco1 24933

Description: Compose a homotopy with a continuous map. (Contributed by Mario Carneiro, 10-Mar-2015.)

**Hypotheses**
Ref	Expression
htpyco1.n	⊢ 𝑁 = (𝑥 ∈ 𝑋, 𝑦 ∈ (0[,]1) ↦ ((𝑃‘𝑥)𝐻𝑦))
htpyco1.j	⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
htpyco1.p	⊢ (𝜑 → 𝑃 ∈ (𝐽 Cn 𝐾))
htpyco1.f	⊢ (𝜑 → 𝐹 ∈ (𝐾 Cn 𝐿))
htpyco1.g	⊢ (𝜑 → 𝐺 ∈ (𝐾 Cn 𝐿))
htpyco1.h	⊢ (𝜑 → 𝐻 ∈ (𝐹(𝐾 Htpy 𝐿)𝐺))

**Assertion**
Ref	Expression
htpyco1	⊢ (𝜑 → 𝑁 ∈ ((𝐹 ∘ 𝑃)(𝐽 Htpy 𝐿)(𝐺 ∘ 𝑃)))

Distinct variable groups: 𝑥,𝑦,𝐻 𝑥,𝐾,𝑦 𝑥,𝐿,𝑦 𝜑,𝑥,𝑦 𝑥,𝐽,𝑦 𝑥,𝑃,𝑦 𝑥,𝑋,𝑦 Allowed substitution hints: 𝐹(𝑥,𝑦) 𝐺(𝑥,𝑦) 𝑁(𝑥,𝑦)

Proof of Theorem htpyco1 Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		htpyco1.j	. 2 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
2		htpyco1.p	. . 3 ⊢ (𝜑 → 𝑃 ∈ (𝐽 Cn 𝐾))
3		htpyco1.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐾 Cn 𝐿))
4		cnco 23210	. . 3 ⊢ ((𝑃 ∈ (𝐽 Cn 𝐾) ∧ 𝐹 ∈ (𝐾 Cn 𝐿)) → (𝐹 ∘ 𝑃) ∈ (𝐽 Cn 𝐿))
5	2, 3, 4	syl2anc 584	. 2 ⊢ (𝜑 → (𝐹 ∘ 𝑃) ∈ (𝐽 Cn 𝐿))
6		htpyco1.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ (𝐾 Cn 𝐿))
7		cnco 23210	. . 3 ⊢ ((𝑃 ∈ (𝐽 Cn 𝐾) ∧ 𝐺 ∈ (𝐾 Cn 𝐿)) → (𝐺 ∘ 𝑃) ∈ (𝐽 Cn 𝐿))
8	2, 6, 7	syl2anc 584	. 2 ⊢ (𝜑 → (𝐺 ∘ 𝑃) ∈ (𝐽 Cn 𝐿))
9		htpyco1.n	. . 3 ⊢ 𝑁 = (𝑥 ∈ 𝑋, 𝑦 ∈ (0[,]1) ↦ ((𝑃‘𝑥)𝐻𝑦))
10		iitopon 24828	. . . . 5 ⊢ II ∈ (TopOn‘(0[,]1))
11	10	a1i 11	. . . 4 ⊢ (𝜑 → II ∈ (TopOn‘(0[,]1)))
12	1, 11	cnmpt1st 23612	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ (0[,]1) ↦ 𝑥) ∈ ((𝐽 ×_t II) Cn 𝐽))
13	1, 11, 12, 2	cnmpt21f 23616	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ (0[,]1) ↦ (𝑃‘𝑥)) ∈ ((𝐽 ×_t II) Cn 𝐾))
14	1, 11	cnmpt2nd 23613	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ (0[,]1) ↦ 𝑦) ∈ ((𝐽 ×_t II) Cn II))
15		cntop2 23185	. . . . . . . 8 ⊢ (𝑃 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
16	2, 15	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top)
17		toptopon2 22862	. . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
18	16, 17	sylib 218	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾))
19	18, 3, 6	htpycn 24928	. . . . 5 ⊢ (𝜑 → (𝐹(𝐾 Htpy 𝐿)𝐺) ⊆ ((𝐾 ×_t II) Cn 𝐿))
20		htpyco1.h	. . . . 5 ⊢ (𝜑 → 𝐻 ∈ (𝐹(𝐾 Htpy 𝐿)𝐺))
21	19, 20	sseldd 3934	. . . 4 ⊢ (𝜑 → 𝐻 ∈ ((𝐾 ×_t II) Cn 𝐿))
22	1, 11, 13, 14, 21	cnmpt22f 23619	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ (0[,]1) ↦ ((𝑃‘𝑥)𝐻𝑦)) ∈ ((𝐽 ×_t II) Cn 𝐿))
23	9, 22	eqeltrid 2840	. 2 ⊢ (𝜑 → 𝑁 ∈ ((𝐽 ×_t II) Cn 𝐿))
24		cnf2 23193	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑃 ∈ (𝐽 Cn 𝐾)) → 𝑃:𝑋⟶∪ 𝐾)
25	1, 18, 2, 24	syl3anc 1373	. . . . . 6 ⊢ (𝜑 → 𝑃:𝑋⟶∪ 𝐾)
26	25	ffvelcdmda 7029	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → (𝑃‘𝑠) ∈ ∪ 𝐾)
27	18, 3, 6, 20	htpyi 24929	. . . . 5 ⊢ ((𝜑 ∧ (𝑃‘𝑠) ∈ ∪ 𝐾) → (((𝑃‘𝑠)𝐻0) = (𝐹‘(𝑃‘𝑠)) ∧ ((𝑃‘𝑠)𝐻1) = (𝐺‘(𝑃‘𝑠))))
28	26, 27	syldan 591	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → (((𝑃‘𝑠)𝐻0) = (𝐹‘(𝑃‘𝑠)) ∧ ((𝑃‘𝑠)𝐻1) = (𝐺‘(𝑃‘𝑠))))
29	28	simpld 494	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → ((𝑃‘𝑠)𝐻0) = (𝐹‘(𝑃‘𝑠)))
30		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → 𝑠 ∈ 𝑋)
31		0elunit 13385	. . . 4 ⊢ 0 ∈ (0[,]1)
32		fveq2 6834	. . . . . 6 ⊢ (𝑥 = 𝑠 → (𝑃‘𝑥) = (𝑃‘𝑠))
33		id 22	. . . . . 6 ⊢ (𝑦 = 0 → 𝑦 = 0)
34	32, 33	oveqan12d 7377	. . . . 5 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → ((𝑃‘𝑥)𝐻𝑦) = ((𝑃‘𝑠)𝐻0))
35		ovex 7391	. . . . 5 ⊢ ((𝑃‘𝑠)𝐻0) ∈ V
36	34, 9, 35	ovmpoa 7513	. . . 4 ⊢ ((𝑠 ∈ 𝑋 ∧ 0 ∈ (0[,]1)) → (𝑠𝑁0) = ((𝑃‘𝑠)𝐻0))
37	30, 31, 36	sylancl 586	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → (𝑠𝑁0) = ((𝑃‘𝑠)𝐻0))
38		fvco3 6933	. . . 4 ⊢ ((𝑃:𝑋⟶∪ 𝐾 ∧ 𝑠 ∈ 𝑋) → ((𝐹 ∘ 𝑃)‘𝑠) = (𝐹‘(𝑃‘𝑠)))
39	25, 38	sylan 580	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → ((𝐹 ∘ 𝑃)‘𝑠) = (𝐹‘(𝑃‘𝑠)))
40	29, 37, 39	3eqtr4d 2781	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → (𝑠𝑁0) = ((𝐹 ∘ 𝑃)‘𝑠))
41	28	simprd 495	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → ((𝑃‘𝑠)𝐻1) = (𝐺‘(𝑃‘𝑠)))
42		1elunit 13386	. . . 4 ⊢ 1 ∈ (0[,]1)
43		id 22	. . . . . 6 ⊢ (𝑦 = 1 → 𝑦 = 1)
44	32, 43	oveqan12d 7377	. . . . 5 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → ((𝑃‘𝑥)𝐻𝑦) = ((𝑃‘𝑠)𝐻1))
45		ovex 7391	. . . . 5 ⊢ ((𝑃‘𝑠)𝐻1) ∈ V
46	44, 9, 45	ovmpoa 7513	. . . 4 ⊢ ((𝑠 ∈ 𝑋 ∧ 1 ∈ (0[,]1)) → (𝑠𝑁1) = ((𝑃‘𝑠)𝐻1))
47	30, 42, 46	sylancl 586	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → (𝑠𝑁1) = ((𝑃‘𝑠)𝐻1))
48		fvco3 6933	. . . 4 ⊢ ((𝑃:𝑋⟶∪ 𝐾 ∧ 𝑠 ∈ 𝑋) → ((𝐺 ∘ 𝑃)‘𝑠) = (𝐺‘(𝑃‘𝑠)))
49	25, 48	sylan 580	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → ((𝐺 ∘ 𝑃)‘𝑠) = (𝐺‘(𝑃‘𝑠)))
50	41, 47, 49	3eqtr4d 2781	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑋) → (𝑠𝑁1) = ((𝐺 ∘ 𝑃)‘𝑠))
51	1, 5, 8, 23, 40, 50	ishtpyd 24930	1 ⊢ (𝜑 → 𝑁 ∈ ((𝐹 ∘ 𝑃)(𝐽 Htpy 𝐿)(𝐺 ∘ 𝑃)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∪ cuni 4863 ∘ ccom 5628 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 ∈ cmpo 7360 0cc0 11026 1c1 11027 [,]cicc 13264 Topctop 22837 TopOnctopon 22854 Cn ccn 23168 ×_t ctx 23504 IIcii 24824 Htpy chtpy 24922

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-q 12862 df-rp 12906 df-xneg 13026 df-xadd 13027 df-xmul 13028 df-icc 13268 df-seq 13925 df-exp 13985 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-topgen 17363 df-psmet 21301 df-xmet 21302 df-met 21303 df-bl 21304 df-mopn 21305 df-top 22838 df-topon 22855 df-bases 22890 df-cn 23171 df-tx 23506 df-ii 24826 df-htpy 24925

This theorem is referenced by: (None)

W3C validator