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 25225

Description: Lemma for reparpht 25226. (Contributed by NM, 15-Jun-2010.) (Revised by Mario Carneiro, 7-Jun-2014.) Avoid ax-mulf 11204. (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 23491	. . 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 25107	. . . . 5 ⊢ II ∈ (TopOn‘(0[,]1))
7	6	a1i 11	. . . 4 ⊢ (𝜑 → II ∈ (TopOn‘(0[,]1)))
8		eqid 2760	. . . . . . . . . . 11 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
9	8	cnfldtop 25009	. . . . . . . . . 10 ⊢ (TopOpen‘ℂ_fld) ∈ Top
10		cnrest2r 23512	. . . . . . . . . 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 23895	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ 𝑦) ∈ ((II ×_t II) Cn II))
13		iirevcn 25158	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (0[,]1) ↦ (1 − 𝑧)) ∈ (II Cn II)
14	13	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑧 ∈ (0[,]1) ↦ (1 − 𝑧)) ∈ (II Cn II))
15		oveq2 7421	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑦 → (1 − 𝑧) = (1 − 𝑦))
16	7, 7, 12, 7, 14, 15	cnmpt21 23897	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (1 − 𝑦)) ∈ ((II ×_t II) Cn II))
17	8	dfii3 25111	. . . . . . . . . . 11 ⊢ II = ((TopOpen‘ℂ_fld) ↾_t (0[,]1))
18	17	oveq2i 7424	. . . . . . . . . 10 ⊢ ((II ×_t II) Cn II) = ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1)))
19	16, 18	eleqtrdi 2870	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (1 − 𝑦)) ∈ ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1))))
20	11, 19	sseldd 3932	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (1 − 𝑦)) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
21	7, 7	cnmpt1st 23894	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ 𝑥) ∈ ((II ×_t II) Cn II))
22	7, 7, 21, 1	cnmpt21f 23898	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐺‘𝑥)) ∈ ((II ×_t II) Cn II))
23	22, 18	eleqtrdi 2870	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐺‘𝑥)) ∈ ((II ×_t II) Cn ((TopOpen‘ℂ_fld) ↾_t (0[,]1))))
24	11, 23	sseldd 3932	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐺‘𝑥)) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
25	8	cnfldtopon 25008	. . . . . . . . 9 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
26	25	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ))
27	8	mpomulcn 25095	. . . . . . . . 9 ⊢ (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣)) ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld))
28	27	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣)) ∈ (((TopOpen‘ℂ_fld) ×_t (TopOpen‘ℂ_fld)) Cn (TopOpen‘ℂ_fld)))
29		oveq12 7422	. . . . . . . 8 ⊢ ((𝑢 = (1 − 𝑦) ∧ 𝑣 = (𝐺‘𝑥)) → (𝑢 · 𝑣) = ((1 − 𝑦) · (𝐺‘𝑥)))
30	7, 7, 20, 24, 26, 26, 28, 29	cnmpt22 23900	. . . . . . 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 3977	. . . . . . . . 9 ⊢ ((II ×_t II) Cn II) ⊆ ((II ×_t II) Cn (TopOpen‘ℂ_fld))
33	32, 12	sselid 3929	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ 𝑦) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
34	32, 21	sselid 3929	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ 𝑥) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
35		oveq12 7422	. . . . . . . 8 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑥) → (𝑢 · 𝑣) = (𝑦 · 𝑥))
36	7, 7, 33, 34, 26, 26, 28, 35	cnmpt22 23900	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝑦 · 𝑥)) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
37	8	addcn 25092	. . . . . . . 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 23901	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ∈ ((II ×_t II) Cn (TopOpen‘ℂ_fld)))
40		iiuni 25109	. . . . . . . . . . . . . . 15 ⊢ (0[,]1) = ∪ II
41	40, 40	cnf 23471	. . . . . . . . . . . . . 14 ⊢ (𝐺 ∈ (II Cn II) → 𝐺:(0[,]1)⟶(0[,]1))
42	1, 41	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺:(0[,]1)⟶(0[,]1))
43	42	ffvelcdmda 7077	. . . . . . . . . . . 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 11234	. . . . . . . . . . . 12 ⊢ 0 ∈ ℝ
48		1re 11232	. . . . . . . . . . . 12 ⊢ 1 ∈ ℝ
49		icccvx 25178	. . . . . . . . . . . 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 3205	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ (0[,]1)∀𝑦 ∈ (0[,]1)(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) ∈ (0[,]1))
53		eqid 2760	. . . . . . . . . 10 ⊢ (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)))
54	53	fmpo 8065	. . . . . . . . 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 6711	. . . . . . 7 ⊢ (𝜑 → ran (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ⊆ (0[,]1))
57		unitsscn 13553	. . . . . . . 8 ⊢ (0[,]1) ⊆ ℂ
58	57	a1i 11	. . . . . . 7 ⊢ (𝜑 → (0[,]1) ⊆ ℂ)
59		cnrest2 23511	. . . . . . 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 2871	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) ∈ ((II ×_t II) Cn II))
63	7, 7, 62, 2	cnmpt21f 23898	. . 3 ⊢ (𝜑 → (𝑥 ∈ (0[,]1), 𝑦 ∈ (0[,]1) ↦ (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)))) ∈ ((II ×_t II) Cn 𝐽))
64	5, 63	eqeltrid 2864	. 2 ⊢ (𝜑 → 𝐻 ∈ ((II ×_t II) Cn 𝐽))
65	42	ffvelcdmda 7077	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐺‘𝑠) ∈ (0[,]1))
66	57, 65	sselid 3929	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐺‘𝑠) ∈ ℂ)
67	66	mullidd 11251	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (1 · (𝐺‘𝑠)) = (𝐺‘𝑠))
68		elunitcn 13521	. . . . . . . 8 ⊢ (𝑠 ∈ (0[,]1) → 𝑠 ∈ ℂ)
69	68	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → 𝑠 ∈ ℂ)
70	69	mul02d 11432	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (0 · 𝑠) = 0)
71	67, 70	oveq12d 7431	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 · (𝐺‘𝑠)) + (0 · 𝑠)) = ((𝐺‘𝑠) + 0))
72	66	addridd 11434	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((𝐺‘𝑠) + 0) = (𝐺‘𝑠))
73	71, 72	eqtrd 2795	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 · (𝐺‘𝑠)) + (0 · 𝑠)) = (𝐺‘𝑠))
74	73	fveq2d 6882	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))) = (𝐹‘(𝐺‘𝑠)))
75		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → 𝑠 ∈ (0[,]1))
76		0elunit 13522	. . . 4 ⊢ 0 ∈ (0[,]1)
77		simpr 490	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → 𝑦 = 0)
78	77	oveq2d 7429	. . . . . . . . 9 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (1 − 𝑦) = (1 − 0))
79		1m0e1 12384	. . . . . . . . 9 ⊢ (1 − 0) = 1
80	78, 79	eqtrdi 2811	. . . . . . . 8 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (1 − 𝑦) = 1)
81		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → 𝑥 = 𝑠)
82	81	fveq2d 6882	. . . . . . . 8 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (𝐺‘𝑥) = (𝐺‘𝑠))
83	80, 82	oveq12d 7431	. . . . . . 7 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → ((1 − 𝑦) · (𝐺‘𝑥)) = (1 · (𝐺‘𝑠)))
84	77, 81	oveq12d 7431	. . . . . . 7 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (𝑦 · 𝑥) = (0 · 𝑠))
85	83, 84	oveq12d 7431	. . . . . 6 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) = ((1 · (𝐺‘𝑠)) + (0 · 𝑠)))
86	85	fveq2d 6882	. . . . 5 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 0) → (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))))
87		fvex 6891	. . . . 5 ⊢ (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))) ∈ V
88	86, 5, 87	ovmpoa 7568	. . . 4 ⊢ ((𝑠 ∈ (0[,]1) ∧ 0 ∈ (0[,]1)) → (𝑠𝐻0) = (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))))
89	75, 76, 88	sylancl 598	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠𝐻0) = (𝐹‘((1 · (𝐺‘𝑠)) + (0 · 𝑠))))
90		fvco3 6978	. . . 4 ⊢ ((𝐺:(0[,]1)⟶(0[,]1) ∧ 𝑠 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘𝑠) = (𝐹‘(𝐺‘𝑠)))
91	42, 90	sylan 592	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘𝑠) = (𝐹‘(𝐺‘𝑠)))
92	74, 89, 91	3eqtr4d 2805	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠𝐻0) = ((𝐹 ∘ 𝐺)‘𝑠))
93		1elunit 13523	. . . 4 ⊢ 1 ∈ (0[,]1)
94		simpr 490	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → 𝑦 = 1)
95	94	oveq2d 7429	. . . . . . . . 9 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (1 − 𝑦) = (1 − 1))
96		1m1e0 12337	. . . . . . . . 9 ⊢ (1 − 1) = 0
97	95, 96	eqtrdi 2811	. . . . . . . 8 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (1 − 𝑦) = 0)
98		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → 𝑥 = 𝑠)
99	98	fveq2d 6882	. . . . . . . 8 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (𝐺‘𝑥) = (𝐺‘𝑠))
100	97, 99	oveq12d 7431	. . . . . . 7 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → ((1 − 𝑦) · (𝐺‘𝑥)) = (0 · (𝐺‘𝑠)))
101	94, 98	oveq12d 7431	. . . . . . 7 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (𝑦 · 𝑥) = (1 · 𝑠))
102	100, 101	oveq12d 7431	. . . . . 6 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) = ((0 · (𝐺‘𝑠)) + (1 · 𝑠)))
103	102	fveq2d 6882	. . . . 5 ⊢ ((𝑥 = 𝑠 ∧ 𝑦 = 1) → (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))))
104		fvex 6891	. . . . 5 ⊢ (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))) ∈ V
105	103, 5, 104	ovmpoa 7568	. . . 4 ⊢ ((𝑠 ∈ (0[,]1) ∧ 1 ∈ (0[,]1)) → (𝑠𝐻1) = (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))))
106	75, 93, 105	sylancl 598	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠𝐻1) = (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))))
107	66	mul02d 11432	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (0 · (𝐺‘𝑠)) = 0)
108	69	mullidd 11251	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (1 · 𝑠) = 𝑠)
109	107, 108	oveq12d 7431	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((0 · (𝐺‘𝑠)) + (1 · 𝑠)) = (0 + 𝑠))
110	69	addlidd 11435	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (0 + 𝑠) = 𝑠)
111	109, 110	eqtrd 2795	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((0 · (𝐺‘𝑠)) + (1 · 𝑠)) = 𝑠)
112	111	fveq2d 6882	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐹‘((0 · (𝐺‘𝑠)) + (1 · 𝑠))) = (𝐹‘𝑠))
113	106, 112	eqtrd 2795	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠𝐻1) = (𝐹‘𝑠))
114		reparpht.3	. . . . . . . . 9 ⊢ (𝜑 → (𝐺‘0) = 0)
115	114	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐺‘0) = 0)
116	115	oveq2d 7429	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · (𝐺‘0)) = ((1 − 𝑠) · 0))
117		ax-1cn 11182	. . . . . . . . 9 ⊢ 1 ∈ ℂ
118		subcl 11480	. . . . . . . . 9 ⊢ ((1 ∈ ℂ ∧ 𝑠 ∈ ℂ) → (1 − 𝑠) ∈ ℂ)
119	117, 69, 118	sylancr 599	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (1 − 𝑠) ∈ ℂ)
120	119	mul01d 11433	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · 0) = 0)
121	116, 120	eqtrd 2795	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · (𝐺‘0)) = 0)
122	69	mul01d 11433	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠 · 0) = 0)
123	121, 122	oveq12d 7431	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0)) = (0 + 0))
124		00id 11409	. . . . 5 ⊢ (0 + 0) = 0
125	123, 124	eqtrdi 2811	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0)) = 0)
126	125	fveq2d 6882	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐹‘(((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0))) = (𝐹‘0))
127		simpr 490	. . . . . . . . 9 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → 𝑦 = 𝑠)
128	127	oveq2d 7429	. . . . . . . 8 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (1 − 𝑦) = (1 − 𝑠))
129		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → 𝑥 = 0)
130	129	fveq2d 6882	. . . . . . . 8 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (𝐺‘𝑥) = (𝐺‘0))
131	128, 130	oveq12d 7431	. . . . . . 7 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → ((1 − 𝑦) · (𝐺‘𝑥)) = ((1 − 𝑠) · (𝐺‘0)))
132	127, 129	oveq12d 7431	. . . . . . 7 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (𝑦 · 𝑥) = (𝑠 · 0))
133	131, 132	oveq12d 7431	. . . . . 6 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) = (((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0)))
134	133	fveq2d 6882	. . . . 5 ⊢ ((𝑥 = 0 ∧ 𝑦 = 𝑠) → (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝐹‘(((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0))))
135		fvex 6891	. . . . 5 ⊢ (𝐹‘(((1 − 𝑠) · (𝐺‘0)) + (𝑠 · 0))) ∈ V
136	134, 5, 135	ovmpoa 7568	. . . 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 6978	. . . . . 6 ⊢ ((𝐺:(0[,]1)⟶(0[,]1) ∧ 0 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘0) = (𝐹‘(𝐺‘0)))
139	42, 76, 138	sylancl 598	. . . . 5 ⊢ (𝜑 → ((𝐹 ∘ 𝐺)‘0) = (𝐹‘(𝐺‘0)))
140	114	fveq2d 6882	. . . . 5 ⊢ (𝜑 → (𝐹‘(𝐺‘0)) = (𝐹‘0))
141	139, 140	eqtrd 2795	. . . 4 ⊢ (𝜑 → ((𝐹 ∘ 𝐺)‘0) = (𝐹‘0))
142	141	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘0) = (𝐹‘0))
143	126, 137, 142	3eqtr4d 2805	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (0𝐻𝑠) = ((𝐹 ∘ 𝐺)‘0))
144		reparpht.4	. . . . . . . . 9 ⊢ (𝜑 → (𝐺‘1) = 1)
145	144	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐺‘1) = 1)
146	145	oveq2d 7429	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · (𝐺‘1)) = ((1 − 𝑠) · 1))
147	119	mulridd 11250	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · 1) = (1 − 𝑠))
148	146, 147	eqtrd 2795	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) · (𝐺‘1)) = (1 − 𝑠))
149	69	mulridd 11250	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝑠 · 1) = 𝑠)
150	148, 149	oveq12d 7431	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1)) = ((1 − 𝑠) + 𝑠))
151		npcan 11490	. . . . . 6 ⊢ ((1 ∈ ℂ ∧ 𝑠 ∈ ℂ) → ((1 − 𝑠) + 𝑠) = 1)
152	117, 69, 151	sylancr 599	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((1 − 𝑠) + 𝑠) = 1)
153	150, 152	eqtrd 2795	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1)) = 1)
154	153	fveq2d 6882	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (𝐹‘(((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1))) = (𝐹‘1))
155		simpr 490	. . . . . . . . 9 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → 𝑦 = 𝑠)
156	155	oveq2d 7429	. . . . . . . 8 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (1 − 𝑦) = (1 − 𝑠))
157		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → 𝑥 = 1)
158	157	fveq2d 6882	. . . . . . . 8 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (𝐺‘𝑥) = (𝐺‘1))
159	156, 158	oveq12d 7431	. . . . . . 7 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → ((1 − 𝑦) · (𝐺‘𝑥)) = ((1 − 𝑠) · (𝐺‘1)))
160	155, 157	oveq12d 7431	. . . . . . 7 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (𝑦 · 𝑥) = (𝑠 · 1))
161	159, 160	oveq12d 7431	. . . . . 6 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥)) = (((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1)))
162	161	fveq2d 6882	. . . . 5 ⊢ ((𝑥 = 1 ∧ 𝑦 = 𝑠) → (𝐹‘(((1 − 𝑦) · (𝐺‘𝑥)) + (𝑦 · 𝑥))) = (𝐹‘(((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1))))
163		fvex 6891	. . . . 5 ⊢ (𝐹‘(((1 − 𝑠) · (𝐺‘1)) + (𝑠 · 1))) ∈ V
164	162, 5, 163	ovmpoa 7568	. . . 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 6978	. . . . . 6 ⊢ ((𝐺:(0[,]1)⟶(0[,]1) ∧ 1 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘1) = (𝐹‘(𝐺‘1)))
167	42, 93, 166	sylancl 598	. . . . 5 ⊢ (𝜑 → ((𝐹 ∘ 𝐺)‘1) = (𝐹‘(𝐺‘1)))
168	144	fveq2d 6882	. . . . 5 ⊢ (𝜑 → (𝐹‘(𝐺‘1)) = (𝐹‘1))
169	167, 168	eqtrd 2795	. . . 4 ⊢ (𝜑 → ((𝐹 ∘ 𝐺)‘1) = (𝐹‘1))
170	169	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → ((𝐹 ∘ 𝐺)‘1) = (𝐹‘1))
171	154, 165, 170	3eqtr4d 2805	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (0[,]1)) → (1𝐻𝑠) = ((𝐹 ∘ 𝐺)‘1))
172	4, 2, 64, 92, 113, 143, 171	isphtpy2d 25215	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 2145 ∀wral 3076 ⊆ wss 3899 ↦ cmpt 5186 × cxp 5653 ran crn 5656 ∘ ccom 5659 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 ∈ cmpo 7415 ℂcc 11122 ℝcr 11123 0cc0 11124 1c1 11125 + caddc 11127 · cmul 11129 − cmin 11465 [,]cicc 13401 ↾_t crest 17505 TopOpenctopn 17506 ℂ_fldccnfld 21585 Topctop 23118 TopOnctopon 23135 Cn ccn 23449 ×_t ctx 23786 IIcii 25103 PHtpycphtpy 25196

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 ax-addf 11203

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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-of 7678 df-om 7863 df-1st 7986 df-2nd 7987 df-supp 8159 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-er 8696 df-map 8828 df-ixp 8905 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-fsupp 9332 df-fi 9381 df-sup 9412 df-inf 9413 df-oi 9482 df-card 9944 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12529 df-z 12616 df-dec 12737 df-uz 12888 df-q 12998 df-rp 13043 df-xneg 13163 df-xadd 13164 df-xmul 13165 df-ioo 13402 df-icc 13405 df-fz 13562 df-fzo 13710 df-seq 14066 df-exp 14126 df-hash 14395 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 df-struct 17239 df-sets 17256 df-slot 17274 df-ndx 17286 df-base 17302 df-ress 17323 df-plusg 17355 df-mulr 17356 df-starv 17357 df-sca 17358 df-vsca 17359 df-ip 17360 df-tset 17361 df-ple 17362 df-ds 17364 df-unif 17365 df-hom 17366 df-cco 17367 df-rest 17507 df-topn 17508 df-0g 17526 df-gsum 17527 df-topgen 17528 df-pt 17529 df-prds 17532 df-xrs 17588 df-qtop 17593 df-imas 17594 df-xps 17596 df-mre 17670 df-mrc 17671 df-acs 17673 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-submnd 18892 df-mulg 19191 df-cntz 19444 df-cmn 19909 df-psmet 21577 df-xmet 21578 df-met 21579 df-bl 21580 df-mopn 21581 df-cnfld 21586 df-top 23119 df-topon 23136 df-topsp 23158 df-bases 23171 df-cn 23452 df-cnp 23453 df-tx 23788 df-hmeo 23981 df-xms 24546 df-ms 24547 df-tms 24548 df-ii 25105 df-htpy 25198 df-phtpy 25199

This theorem is used by: reparpht 25226

W3C validator