reparphti - Metamath Proof Explorer

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

Theorem reparphti 25207

Description: Lemma for reparpht 25208. (Contributed by NM, 15-Jun-2010.) (Revised by Mario Carneiro, 7-Jun-2014.) Avoid ax-mulf 11195. (Revised by GG, 16-Mar-2025.)

**Hypotheses**
Ref	Expression
reparpht.1	⊢ (𝜑 → 𝐹 ∈ (II Cn 𝐽))
reparpht.2	⊢ (𝜑 → 𝐺 ∈ (II Cn II))
reparpht.3	⊢ (𝜑 → (𝐺‘0) = 0)
reparpht.4	⊢ (𝜑 → (𝐺‘1) = 1)
reparphti.5	⊢ 𝐻 = (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))))

**Assertion**
Ref	Expression
reparphti	⊢ (𝜑 → 𝐻 ∈ ((𝐹 ∘ 𝐺)(PHtpy‘𝐽)𝐹))

Distinct variable groups: 𝑥,𝑦,𝐹 𝑥,𝐺,𝑦 𝑥,𝐽,𝑦 𝜑,𝑥,𝑦 Allowed substitution hints: 𝐻(𝑥, 𝑦)

Proof of Theorem reparphti Dummy variables 𝑠 𝑢 𝑣 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		reparpht.2	. . 3 ⊢ (𝜑 → 𝐺 ∈ (II Cn II))
2		reparpht.1	. . 3 ⊢ (𝜑 → 𝐹 ∈ (II Cn 𝐽))
3		cnco 23473	. . 3 ⊢ ((𝐺 ∈ (II Cn II) ∧ 𝐹 ∈ (II Cn 𝐽)) → (𝐹 ∘ 𝐺) ∈ (II Cn 𝐽))
4	1, 2, 3	syl2anc 596	. 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ∈ (II Cn 𝐽))
5		reparphti.5	. . 3 ⊢ 𝐻 = (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))))
6		iitopon 25089	. . . . 5 ⊢ II ∈ (TopOn‘(0[,]1))
7	6	a1i 11	. . . 4 ⊢ (𝜑 → II ∈ (TopOn‘(0[,]1)))
8		eqid 2765	. . . . . . . . . . 11 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
9	8	cnfldtop 24991	. . . . . . . . . 10 ⊢ (TopOpen‘ℂ_fld) ∈ Top
10		cnrest2r 23494	. . . . . . . . . 10 ⊢ ((TopOpen‘ℂ_fld) ∈ Top → ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1))) ⊆ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
11	9, 10	mp1i 14	. . . . . . . . 9 ⊢ (𝜑 → ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1))) ⊆ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
12	7, 7	cnmpt2nd 23877	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ 𝑦) ∈ ((II ×_t II) Cn II))
13		iirevcn 25140	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (0[,]1) ↦ (1 − 𝑧)) ∈ (II Cn II)
14	13	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑧 ∈ (0[,]1) ↦ (1 − 𝑧)) ∈ (II Cn II))
15		oveq2 7427	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑦 → (1 − 𝑧) = (1 − 𝑦))
16	7, 7, 12, 7, 14, 15	cnmpt21 23879	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (1 − 𝑦)) ∈ ((II ×_t II) Cn II))
17	8	dfii3 25093	. . . . . . . . . . 11 ⊢ II = ((TopOpen‘ℂ_fld) ↾_t (0[,]1))
18	17	oveq2i 7430	. . . . . . . . . 10 ⊢ ((II ×_t II) Cn II) = ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1)))
19	16, 18	eleqtrdi 2875	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (1 − 𝑦)) ∈ ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1))))
20	11, 19	sseldd 3939	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (1 − 𝑦)) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
21	7, 7	cnmpt1st 23876	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ 𝑥) ∈ ((II ×_t II) Cn II))
22	7, 7, 21, 1	cnmpt21f 23880	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐺‘𝑥)) ∈ ((II ×_t II) Cn II))
23	22, 18	eleqtrdi 2875	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐺‘𝑥)) ∈ ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1))))
24	11, 23	sseldd 3939	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐺‘𝑥)) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
25	8	cnfldtopon 24990	. . . . . . . . 9 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
26	25	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ))
27	8	mpomulcn 25077	. . . . . . . . 9 ⊢ (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣)) ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld))
28	27	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣)) ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld)))
29		oveq12 7428	. . . . . . . 8 ⊢ ((𝑢 = (1 − 𝑦) ∧ 𝑣 = (𝐺‘𝑥)) → (𝑢 · 𝑣) = ((1 − 𝑦) · (𝐺‘𝑥)))
30	7, 7, 20, 24, 26, 26, 28, 29	cnmpt22 23882	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ ((1 − 𝑦) · (𝐺‘𝑥))) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
31	9, 10	ax-mp 5	. . . . . . . . . 10 ⊢ ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1))) ⊆ ((II ×_t II) Cn (TopOpen‘ℂ_fld))
32	18, 31	eqsstri 3984	. . . . . . . . 9 ⊢ ((II ×_t II) Cn II) ⊆ ((II ×_t II) Cn (TopOpen‘ℂ_fld))
33	32, 12	sselid 3936	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ 𝑦) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
34	32, 21	sselid 3936	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ 𝑥) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
35		oveq12 7428	. . . . . . . 8 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑥) → (𝑢 · 𝑣) = (𝑦 · 𝑥))
36	7, 7, 33, 34, 26, 26, 28, 35	cnmpt22 23882	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝑦 · 𝑥)) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
37	8	addcn 25074	. . . . . . . 8 ⊢ + ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld))
38	37	a1i 11	. . . . . . 7 ⊢ (𝜑 → + ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld)))
39	7, 7, 30, 36, 38	cnmpt22f 23883	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
40		iiuni 25091	. . . . . . . . . . . . . . 15 ⊢ (0[,]1) = ∪ II
41	40, 40	cnf 23453	. . . . . . . . . . . . . 14 ⊢ (𝐺 ∈ (II Cn II) → 𝐺:(0[,]1)⟶(0[,]1))
42	1, 41	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺:(0[,]1)⟶(0[,]1))
43	42	ffvelcdmda 7083	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (0[,]1)) → (𝐺‘𝑥) ∈ (0[,]1))
44	43	adantrr 730	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ (0[,]1) ∧ 𝑦 ∈ (0[,]1))) → (𝐺‘𝑥) ∈ (0[,]1))
45		simprl 783	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ (0[,]1) ∧ 𝑦 ∈ (0[,]1))) → 𝑥 ∈ (0[,]1))
46		simprr 785	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ (0[,]1) ∧ 𝑦 ∈ (0[,]1))) → 𝑦 ∈ (0[,]1))
47		0re 11225	. . . . . . . . . . . 12 ⊢ 0 ∈ ℝ
48		1re 11223	. . . . . . . . . . . 12 ⊢ 1 ∈ ℝ
49		icccvx 25160	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ) → (((𝐺‘𝑥) ∈ (0[,]1) ∧ 𝑥 ∈ (0[,]1) ∧ 𝑦 ∈ (0[,]1)) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) ∈ (0[,]1)))
50	47, 48, 49	mp2an 705	. . . . . . . . . . 11 ⊢ (((𝐺‘𝑥) ∈ (0[,]1) ∧ 𝑥 ∈ (0[,]1) ∧ 𝑦 ∈ (0[,]1)) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) ∈ (0[,]1))
51	44, 45, 46, 50	syl3anc 1398	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ (0[,]1) ∧ 𝑦 ∈ (0[,]1))) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) ∈ (0[,]1))
52	51	ralrimivva 3210	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ (0[,]1)∀𝑦 ∈ (0[,]1)(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) ∈ (0[,]1))
53		eqid 2765	. . . . . . . . . 10 ⊢ (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)))
54	53	fmpo 8071	. . . . . . . . 9 ⊢ (∀𝑥 ∈ (0[,]1)∀𝑦 ∈ (0[,]1)(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) ∈ (0[,]1) ↔ (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))):((0[,]1) × (0[,]1))⟶(0[,]1))
55	52, 54	sylib 221	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))):((0[,]1) × (0[,]1))⟶(0[,]1))
56	55	frnd 6718	. . . . . . 7 ⊢ (𝜑 → ran (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ⊆ (0[,]1))
57		unitsscn 13543	. . . . . . . 8 ⊢ (0[,]1) ⊆ ℂ
58	57	a1i 11	. . . . . . 7 ⊢ (𝜑 → (0[,]1) ⊆ ℂ)
59		cnrest2 23493	. . . . . . 7 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ ran (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ⊆ (0[,]1) ∧ (0[,]1) ⊆ ℂ) → ((𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)) ↔ (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ∈ ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1)))))
60	26, 56, 58, 59	syl3anc 1398	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)) ↔ (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ∈ ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1)))))
61	39, 60	mpbid 235	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ∈ ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1))))
62	61, 18	eleqtrrdi 2876	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ∈ ((II ×_t II) Cn II))
63	7, 7, 62, 2	cnmpt21f 23880	. . 3 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)))) ∈ ((II ×_t II) Cn 𝐽))
64	5, 63	eqeltrid 2869	. 2 ⊢ (𝜑 → 𝐻 ∈ ((II ×_t II) Cn 𝐽))
65	42	ffvelcdmda 7083	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐺‘𝑠) ∈ (0[,]1))
66	57, 65	sselid 3936	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐺‘𝑠) ∈ ℂ)
67	66	mullidd 11242	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (1 · (𝐺‘𝑠)) = (𝐺‘𝑠))
68		elunitcn 13511	. . . . . . . 8 ⊢ (𝑠 ∈ (0[,]1) → 𝑠 ∈ ℂ)
69	68	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → 𝑠 ∈ ℂ)
70	69	mul02d 11423	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (0 · 𝑠) = 0)
71	67, 70	oveq12d 7437	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 · (𝐺‘𝑠)) + (0 · 𝑠)) = ((𝐺‘𝑠) + 0))
72	66	addridd 11425	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((𝐺‘𝑠) + 0) = (𝐺‘𝑠))
73	71, 72	eqtrd 2800	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 · (𝐺‘𝑠)) + (0 · 𝑠)) = (𝐺‘𝑠))
74	73	fveq2d 6889	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))) = (𝐹‘(𝐺‘𝑠)))
75		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → 𝑠 ∈ (0[,]1))
76		0elunit 13512	. . . 4 ⊢ 0 ∈ (0[,]1)
77		simpr 490	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → 𝑦 = 0)
78	77	oveq2d 7435	. . . . . . . . 9 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (1 − 𝑦) = (1 − 0))
79		1m0e1 12375	. . . . . . . . 9 ⊢ (1 − 0) = 1
80	78, 79	eqtrdi 2816	. . . . . . . 8 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (1 − 𝑦) = 1)
81		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → 𝑥 = 𝑠)
82	81	fveq2d 6889	. . . . . . . 8 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (𝐺‘𝑥) = (𝐺‘𝑠))
83	80, 82	oveq12d 7437	. . . . . . 7 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → ((1 − 𝑦) · (𝐺‘𝑥)) = (1 · (𝐺‘𝑠)))
84	77, 81	oveq12d 7437	. . . . . . 7 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (𝑦 · 𝑥) = (0 · 𝑠))
85	83, 84	oveq12d 7437	. . . . . 6 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) = ((1 · (𝐺‘𝑠)) + (0 · 𝑠)))
86	85	fveq2d 6889	. . . . 5 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))))
87		fvex 6898	. . . . 5 ⊢ (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))) ∈ V
88	86, 5, 87	ovmpoa 7574	. . . 4 ⊢ ((𝑠 ∈ (0[,]1) ∧ 0 ∈ (0[,]1)) → (𝑠𝐻0) = (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))))
89	75, 76, 88	sylancl 598	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠𝐻0) = (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))))
90		fvco3 6985	. . . 4 ⊢ ((𝐺:(0[,]1)⟶(0[,]1) ∧ 𝑠 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘𝑠) = (𝐹‘(𝐺‘𝑠)))
91	42, 90	sylan 592	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘𝑠) = (𝐹‘(𝐺‘𝑠)))
92	74, 89, 91	3eqtr4d 2810	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠𝐻0) = ((𝐹 ∘ 𝐺)‘𝑠))
93		1elunit 13513	. . . 4 ⊢ 1 ∈ (0[,]1)
94		simpr 490	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → 𝑦 = 1)
95	94	oveq2d 7435	. . . . . . . . 9 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (1 − 𝑦) = (1 − 1))
96		1m1e0 12328	. . . . . . . . 9 ⊢ (1 − 1) = 0
97	95, 96	eqtrdi 2816	. . . . . . . 8 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (1 − 𝑦) = 0)
98		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → 𝑥 = 𝑠)
99	98	fveq2d 6889	. . . . . . . 8 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (𝐺‘𝑥) = (𝐺‘𝑠))
100	97, 99	oveq12d 7437	. . . . . . 7 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → ((1 − 𝑦) · (𝐺‘𝑥)) = (0 · (𝐺‘𝑠)))
101	94, 98	oveq12d 7437	. . . . . . 7 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (𝑦 · 𝑥) = (1 · 𝑠))
102	100, 101	oveq12d 7437	. . . . . 6 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) = ((0 · (𝐺‘𝑠)) + (1 · 𝑠)))
103	102	fveq2d 6889	. . . . 5 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))))
104		fvex 6898	. . . . 5 ⊢ (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))) ∈ V
105	103, 5, 104	ovmpoa 7574	. . . 4 ⊢ ((𝑠 ∈ (0[,]1) ∧ 1 ∈ (0[,]1)) → (𝑠𝐻1) = (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))))
106	75, 93, 105	sylancl 598	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠𝐻1) = (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))))
107	66	mul02d 11423	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (0 · (𝐺‘𝑠)) = 0)
108	69	mullidd 11242	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (1 · 𝑠) = 𝑠)
109	107, 108	oveq12d 7437	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((0 · (𝐺‘𝑠)) + (1 · 𝑠)) = (0 + 𝑠))
110	69	addlidd 11426	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (0 + 𝑠) = 𝑠)
111	109, 110	eqtrd 2800	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((0 · (𝐺‘𝑠)) + (1 · 𝑠)) = 𝑠)
112	111	fveq2d 6889	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))) = (𝐹‘𝑠))
113	106, 112	eqtrd 2800	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠𝐻1) = (𝐹‘𝑠))
114		reparpht.3	. . . . . . . . 9 ⊢ (𝜑 → (𝐺‘0) = 0)
115	114	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐺‘0) = 0)
116	115	oveq2d 7435	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · (𝐺‘0)) = ((1 − 𝑠) · 0))
117		ax-1cn 11173	. . . . . . . . 9 ⊢ 1 ∈ ℂ
118		subcl 11471	. . . . . . . . 9 ⊢ ((1 ∈ ℂ ∧ 𝑠 ∈ ℂ) → (1 − 𝑠) ∈ ℂ)
119	117, 69, 118	sylancr 599	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (1 − 𝑠) ∈ ℂ)
120	119	mul01d 11424	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · 0) = 0)
121	116, 120	eqtrd 2800	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · (𝐺‘0)) = 0)
122	69	mul01d 11424	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠 · 0) = 0)
123	121, 122	oveq12d 7437	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0)) = (0 + 0))
124		00id 11400	. . . . 5 ⊢ (0 + 0) = 0
125	123, 124	eqtrdi 2816	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0)) = 0)
126	125	fveq2d 6889	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐹‘(((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0))) = (𝐹‘0))
127		simpr 490	. . . . . . . . 9 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → 𝑦 = 𝑠)
128	127	oveq2d 7435	. . . . . . . 8 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (1 − 𝑦) = (1 − 𝑠))
129		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → 𝑥 = 0)
130	129	fveq2d 6889	. . . . . . . 8 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (𝐺‘𝑥) = (𝐺‘0))
131	128, 130	oveq12d 7437	. . . . . . 7 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → ((1 − 𝑦) · (𝐺‘𝑥)) = ((1 − 𝑠) · (𝐺‘0)))
132	127, 129	oveq12d 7437	. . . . . . 7 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (𝑦 · 𝑥) = (𝑠 · 0))
133	131, 132	oveq12d 7437	. . . . . 6 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) = (((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0)))
134	133	fveq2d 6889	. . . . 5 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝐹‘(((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0))))
135		fvex 6898	. . . . 5 ⊢ (𝐹‘(((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0))) ∈ V
136	134, 5, 135	ovmpoa 7574	. . . 4 ⊢ ((0 ∈ (0[,]1) ∧ 𝑠 ∈ (0[,]1)) → (0𝐻𝑠) = (𝐹‘(((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0))))
137	76, 75, 136	sylancr 599	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (0𝐻𝑠) = (𝐹‘(((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0))))
138		fvco3 6985	. . . . . 6 ⊢ ((𝐺:(0[,]1)⟶(0[,]1) ∧ 0 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘0) = (𝐹‘(𝐺‘0)))
139	42, 76, 138	sylancl 598	. . . . 5 ⊢ (𝜑 → ((𝐹 ∘ 𝐺)‘0) = (𝐹‘(𝐺‘0)))
140	114	fveq2d 6889	. . . . 5 ⊢ (𝜑 → (𝐹‘(𝐺‘0)) = (𝐹‘0))
141	139, 140	eqtrd 2800	. . . 4 ⊢ (𝜑 → ((𝐹 ∘ 𝐺)‘0) = (𝐹‘0))
142	141	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘0) = (𝐹‘0))
143	126, 137, 142	3eqtr4d 2810	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (0𝐻𝑠) = ((𝐹 ∘ 𝐺)‘0))
144		reparpht.4	. . . . . . . . 9 ⊢ (𝜑 → (𝐺‘1) = 1)
145	144	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐺‘1) = 1)
146	145	oveq2d 7435	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · (𝐺‘1)) = ((1 − 𝑠) · 1))
147	119	mulridd 11241	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · 1) = (1 − 𝑠))
148	146, 147	eqtrd 2800	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · (𝐺‘1)) = (1 − 𝑠))
149	69	mulridd 11241	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠 · 1) = 𝑠)
150	148, 149	oveq12d 7437	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1)) = ((1 − 𝑠) + 𝑠))
151		npcan 11481	. . . . . 6 ⊢ ((1 ∈ ℂ ∧ 𝑠 ∈ ℂ) → ((1 − 𝑠) + 𝑠) = 1)
152	117, 69, 151	sylancr 599	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) + 𝑠) = 1)
153	150, 152	eqtrd 2800	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1)) = 1)
154	153	fveq2d 6889	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐹‘(((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1))) = (𝐹‘1))
155		simpr 490	. . . . . . . . 9 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → 𝑦 = 𝑠)
156	155	oveq2d 7435	. . . . . . . 8 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (1 − 𝑦) = (1 − 𝑠))
157		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → 𝑥 = 1)
158	157	fveq2d 6889	. . . . . . . 8 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (𝐺‘𝑥) = (𝐺‘1))
159	156, 158	oveq12d 7437	. . . . . . 7 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → ((1 − 𝑦) · (𝐺‘𝑥)) = ((1 − 𝑠) · (𝐺‘1)))
160	155, 157	oveq12d 7437	. . . . . . 7 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (𝑦 · 𝑥) = (𝑠 · 1))
161	159, 160	oveq12d 7437	. . . . . 6 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) = (((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1)))
162	161	fveq2d 6889	. . . . 5 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝐹‘(((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1))))
163		fvex 6898	. . . . 5 ⊢ (𝐹‘(((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1))) ∈ V
164	162, 5, 163	ovmpoa 7574	. . . 4 ⊢ ((1 ∈ (0[,]1) ∧ 𝑠 ∈ (0[,]1)) → (1𝐻𝑠) = (𝐹‘(((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1))))
165	93, 75, 164	sylancr 599	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (1𝐻𝑠) = (𝐹‘(((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1))))
166		fvco3 6985	. . . . . 6 ⊢ ((𝐺:(0[,]1)⟶(0[,]1) ∧ 1 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘1) = (𝐹‘(𝐺‘1)))
167	42, 93, 166	sylancl 598	. . . . 5 ⊢ (𝜑 → ((𝐹 ∘ 𝐺)‘1) = (𝐹‘(𝐺‘1)))
168	144	fveq2d 6889	. . . . 5 ⊢ (𝜑 → (𝐹‘(𝐺‘1)) = (𝐹‘1))
169	167, 168	eqtrd 2800	. . . 4 ⊢ (𝜑 → ((𝐹 ∘ 𝐺)‘1) = (𝐹‘1))
170	169	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘1) = (𝐹‘1))
171	154, 165, 170	3eqtr4d 2810	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (1𝐻𝑠) = ((𝐹 ∘ 𝐺)‘1))
172	4, 2, 64, 92, 113, 143, 171	isphtpy2d 25197	1 ⊢ (𝜑 → 𝐻 ∈ ((𝐹 ∘ 𝐺)(PHtpy‘𝐽)𝐹))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ⊆ wss 3906 ↦ cmpt 5194 × cxp 5661 ran crn 5664 ∘ ccom 5667 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 ∈ cmpo 7421 ℂcc 11113 ℝcr 11114 0cc0 11115 1c1 11116 + caddc 11118 · cmul 11120 − cmin 11456 [,]cicc 13391 ↾_t crest 17495 TopOpenctopn 17496 ℂ_fldccnfld 21572 Topctop 23100 TopOnctopon 23117 Cn ccn 23431 ×_t ctx 23768 IIcii 25085 PHtpycphtpy 25178

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193 ax-addf 11194

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 df-om 7869 df-1st 7992 df-2nd 7993 df-supp 8163 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-ixp 8902 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fsupp 9329 df-fi 9378 df-sup 9409 df-inf 9410 df-oi 9479 df-card 9941 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-4 12320 df-5 12321 df-6 12322 df-7 12323 df-8 12324 df-9 12325 df-n0 12520 df-z 12607 df-dec 12728 df-uz 12879 df-q 12989 df-rp 13033 df-xneg 13153 df-xadd 13154 df-xmul 13155 df-ioo 13392 df-icc 13395 df-fz 13552 df-fzo 13700 df-seq 14056 df-exp 14116 df-hash 14385 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 df-struct 17229 df-sets 17246 df-slot 17264 df-ndx 17276 df-base 17292 df-ress 17313 df-plusg 17345 df-mulr 17346 df-starv 17347 df-sca 17348 df-vsca 17349 df-ip 17350 df-tset 17351 df-ple 17352 df-ds 17354 df-unif 17355 df-hom 17356 df-cco 17357 df-rest 17497 df-topn 17498 df-0g 17516 df-gsum 17517 df-topgen 17518 df-pt 17519 df-prds 17522 df-xrs 17578 df-qtop 17583 df-imas 17584 df-xps 17586 df-mre 17660 df-mrc 17661 df-acs 17663 df-mgm 18720 df-sgrp 18809 df-mnd 18825 df-submnd 18879 df-mulg 19178 df-cntz 19431 df-cmn 19896 df-psmet 21564 df-xmet 21565 df-met 21566 df-bl 21567 df-mopn 21568 df-cnfld 21573 df-top 23101 df-topon 23118 df-topsp 23140 df-bases 23153 df-cn 23434 df-cnp 23435 df-tx 23770 df-hmeo 23963 df-xms 24528 df-ms 24529 df-tms 24530 df-ii 25087 df-htpy 25180 df-phtpy 25181

This theorem is used by: reparpht 25208

W3C validator