pcopt - Metamath Proof Explorer

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

Theorem pcopt 23034

Description: Concatenation with a point does not affect homotopy class. (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Mario Carneiro, 20-Dec-2013.)

**Hypothesis**
Ref	Expression
pcopt.1	⊢ 𝑃 = ((0[,]1) × {𝑌})

**Assertion**
Ref	Expression
pcopt	⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑃(*_𝑝‘𝐽)𝐹)( ≃_ph‘𝐽)𝐹)

Proof of Theorem pcopt Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pcopt.1	. . . . . . . . . 10 ⊢ 𝑃 = ((0[,]1) × {𝑌})
2	1	fveq1i 6409	. . . . . . . . 9 ⊢ (𝑃‘(2 · 𝑥)) = (((0[,]1) × {𝑌})‘(2 · 𝑥))
3		simpr 473	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝐹‘0) = 𝑌)
4		iiuni 22897	. . . . . . . . . . . . . 14 ⊢ (0[,]1) = ∪ II
5		eqid 2806	. . . . . . . . . . . . . 14 ⊢ ∪ 𝐽 = ∪ 𝐽
6	4, 5	cnf 21264	. . . . . . . . . . . . 13 ⊢ (𝐹 ∈ (II Cn 𝐽) → 𝐹:(0[,]1)⟶∪ 𝐽)
7	6	adantr 468	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 𝐹:(0[,]1)⟶∪ 𝐽)
8		0elunit 12511	. . . . . . . . . . . 12 ⊢ 0 ∈ (0[,]1)
9		ffvelrn 6579	. . . . . . . . . . . 12 ⊢ ((𝐹:(0[,]1)⟶∪ 𝐽 ∧ 0 ∈ (0[,]1)) → (𝐹‘0) ∈ ∪ 𝐽)
10	7, 8, 9	sylancl 576	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝐹‘0) ∈ ∪ 𝐽)
11	3, 10	eqeltrrd 2886	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 𝑌 ∈ ∪ 𝐽)
12		elii1 22947	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (0[,](1 / 2)) ↔ (𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2)))
13		iihalf1 22943	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (0[,](1 / 2)) → (2 · 𝑥) ∈ (0[,]1))
14	12, 13	sylbir 226	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2)) → (2 · 𝑥) ∈ (0[,]1))
15		fvconst2g 6692	. . . . . . . . . 10 ⊢ ((𝑌 ∈ ∪ 𝐽 ∧ (2 · 𝑥) ∈ (0[,]1)) → (((0[,]1) × {𝑌})‘(2 · 𝑥)) = 𝑌)
16	11, 14, 15	syl2an 585	. . . . . . . . 9 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2))) → (((0[,]1) × {𝑌})‘(2 · 𝑥)) = 𝑌)
17	2, 16	syl5eq 2852	. . . . . . . 8 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2))) → (𝑃‘(2 · 𝑥)) = 𝑌)
18		simplr 776	. . . . . . . 8 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2))) → (𝐹‘0) = 𝑌)
19	17, 18	eqtr4d 2843	. . . . . . 7 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2))) → (𝑃‘(2 · 𝑥)) = (𝐹‘0))
20	19	ifeq1d 4297	. . . . . 6 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2))) → if(𝑥 ≤ (1 / 2), (𝑃‘(2 · 𝑥)), (𝐹‘((2 · 𝑥) − 1))) = if(𝑥 ≤ (1 / 2), (𝐹‘0), (𝐹‘((2 · 𝑥) − 1))))
21	20	expr 446	. . . . 5 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ 𝑥 ∈ (0[,]1)) → (𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), (𝑃‘(2 · 𝑥)), (𝐹‘((2 · 𝑥) − 1))) = if(𝑥 ≤ (1 / 2), (𝐹‘0), (𝐹‘((2 · 𝑥) − 1)))))
22		iffalse 4288	. . . . . 6 ⊢ (¬ 𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), (𝑃‘(2 · 𝑥)), (𝐹‘((2 · 𝑥) − 1))) = (𝐹‘((2 · 𝑥) − 1)))
23		iffalse 4288	. . . . . 6 ⊢ (¬ 𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), (𝐹‘0), (𝐹‘((2 · 𝑥) − 1))) = (𝐹‘((2 · 𝑥) − 1)))
24	22, 23	eqtr4d 2843	. . . . 5 ⊢ (¬ 𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), (𝑃‘(2 · 𝑥)), (𝐹‘((2 · 𝑥) − 1))) = if(𝑥 ≤ (1 / 2), (𝐹‘0), (𝐹‘((2 · 𝑥) − 1))))
25	21, 24	pm2.61d1 172	. . . 4 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ 𝑥 ∈ (0[,]1)) → if(𝑥 ≤ (1 / 2), (𝑃‘(2 · 𝑥)), (𝐹‘((2 · 𝑥) − 1))) = if(𝑥 ≤ (1 / 2), (𝐹‘0), (𝐹‘((2 · 𝑥) − 1))))
26	25	mpteq2dva 4938	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝑃‘(2 · 𝑥)), (𝐹‘((2 · 𝑥) − 1)))) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘0), (𝐹‘((2 · 𝑥) − 1)))))
27		cntop2 21259	. . . . . . . 8 ⊢ (𝐹 ∈ (II Cn 𝐽) → 𝐽 ∈ Top)
28	27	adantr 468	. . . . . . 7 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 𝐽 ∈ Top)
29	5	toptopon 20935	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
30	28, 29	sylib 209	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 𝐽 ∈ (TopOn‘∪ 𝐽))
31	1	pcoptcl 23033	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝑌 ∈ ∪ 𝐽) → (𝑃 ∈ (II Cn 𝐽) ∧ (𝑃‘0) = 𝑌 ∧ (𝑃‘1) = 𝑌))
32	30, 11, 31	syl2anc 575	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑃 ∈ (II Cn 𝐽) ∧ (𝑃‘0) = 𝑌 ∧ (𝑃‘1) = 𝑌))
33	32	simp1d 1165	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 𝑃 ∈ (II Cn 𝐽))
34		simpl 470	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 𝐹 ∈ (II Cn 𝐽))
35	33, 34	pcoval 23023	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑃(*_𝑝‘𝐽)𝐹) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝑃‘(2 · 𝑥)), (𝐹‘((2 · 𝑥) − 1)))))
36		iffalse 4288	. . . . . . . . 9 ⊢ (¬ 𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) = ((2 · 𝑥) − 1))
37	36	adantl 469	. . . . . . . 8 ⊢ ((𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2)) → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) = ((2 · 𝑥) − 1))
38		elii2 22948	. . . . . . . . 9 ⊢ ((𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2)) → 𝑥 ∈ ((1 / 2)[,]1))
39		iihalf2 22945	. . . . . . . . 9 ⊢ (𝑥 ∈ ((1 / 2)[,]1) → ((2 · 𝑥) − 1) ∈ (0[,]1))
40	38, 39	syl 17	. . . . . . . 8 ⊢ ((𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2)) → ((2 · 𝑥) − 1) ∈ (0[,]1))
41	37, 40	eqeltrd 2885	. . . . . . 7 ⊢ ((𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2)) → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) ∈ (0[,]1))
42	41	ex 399	. . . . . 6 ⊢ (𝑥 ∈ (0[,]1) → (¬ 𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) ∈ (0[,]1)))
43		iftrue 4285	. . . . . . 7 ⊢ (𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) = 0)
44	43, 8	syl6eqel 2893	. . . . . 6 ⊢ (𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) ∈ (0[,]1))
45	42, 44	pm2.61d2 173	. . . . 5 ⊢ (𝑥 ∈ (0[,]1) → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) ∈ (0[,]1))
46	45	adantl 469	. . . 4 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ 𝑥 ∈ (0[,]1)) → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) ∈ (0[,]1))
47		eqid 2806	. . . . 5 ⊢ (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1))) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)))
48	47	a1i 11	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1))) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1))))
49	7	feqmptd 6470	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 𝐹 = (𝑦 ∈ (0[,]1) ↦ (𝐹‘𝑦)))
50		fveq2 6408	. . . . 5 ⊢ (𝑦 = if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) → (𝐹‘𝑦) = (𝐹‘if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1))))
51		fvif 6424	. . . . 5 ⊢ (𝐹‘if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1))) = if(𝑥 ≤ (1 / 2), (𝐹‘0), (𝐹‘((2 · 𝑥) − 1)))
52	50, 51	syl6eq 2856	. . . 4 ⊢ (𝑦 = if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) → (𝐹‘𝑦) = if(𝑥 ≤ (1 / 2), (𝐹‘0), (𝐹‘((2 · 𝑥) − 1))))
53	46, 48, 49, 52	fmptco 6619	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝐹 ∘ (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)))) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘0), (𝐹‘((2 · 𝑥) − 1)))))
54	26, 35, 53	3eqtr4d 2850	. 2 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑃(*_𝑝‘𝐽)𝐹) = (𝐹 ∘ (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)))))
55		iitopon 22895	. . . . 5 ⊢ II ∈ (TopOn‘(0[,]1))
56	55	a1i 11	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → II ∈ (TopOn‘(0[,]1)))
57	56	cnmptid 21678	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ 𝑥) ∈ (II Cn II))
58	8	a1i 11	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 0 ∈ (0[,]1))
59	56, 56, 58	cnmptc 21679	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ 0) ∈ (II Cn II))
60		eqid 2806	. . . . 5 ⊢ (topGen‘ran (,)) = (topGen‘ran (,))
61		eqid 2806	. . . . 5 ⊢ ((topGen‘ran (,)) ↾_t (0[,](1 / 2))) = ((topGen‘ran (,)) ↾_t (0[,](1 / 2)))
62		eqid 2806	. . . . 5 ⊢ ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) = ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1))
63		dfii2 22898	. . . . 5 ⊢ II = ((topGen‘ran (,)) ↾_t (0[,]1))
64		0re 10327	. . . . . 6 ⊢ 0 ∈ ℝ
65	64	a1i 11	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 0 ∈ ℝ)
66		1re 10325	. . . . . 6 ⊢ 1 ∈ ℝ
67	66	a1i 11	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → 1 ∈ ℝ)
68		halfre 11513	. . . . . . 7 ⊢ (1 / 2) ∈ ℝ
69		halfgt0 11515	. . . . . . . 8 ⊢ 0 < (1 / 2)
70	64, 68, 69	ltleii 10445	. . . . . . 7 ⊢ 0 ≤ (1 / 2)
71		halflt1 11517	. . . . . . . 8 ⊢ (1 / 2) < 1
72	68, 66, 71	ltleii 10445	. . . . . . 7 ⊢ (1 / 2) ≤ 1
73		elicc01 12510	. . . . . . 7 ⊢ ((1 / 2) ∈ (0[,]1) ↔ ((1 / 2) ∈ ℝ ∧ 0 ≤ (1 / 2) ∧ (1 / 2) ≤ 1))
74	68, 70, 72, 73	mpbir3an 1434	. . . . . 6 ⊢ (1 / 2) ∈ (0[,]1)
75	74	a1i 11	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (1 / 2) ∈ (0[,]1))
76		simprl 778	. . . . . . . . 9 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑦 = (1 / 2) ∧ 𝑧 ∈ (0[,]1))) → 𝑦 = (1 / 2))
77	76	oveq2d 6890	. . . . . . . 8 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑦 = (1 / 2) ∧ 𝑧 ∈ (0[,]1))) → (2 · 𝑦) = (2 · (1 / 2)))
78		2cn 11375	. . . . . . . . 9 ⊢ 2 ∈ ℂ
79		2ne0 11396	. . . . . . . . 9 ⊢ 2 ≠ 0
80	78, 79	recidi 11041	. . . . . . . 8 ⊢ (2 · (1 / 2)) = 1
81	77, 80	syl6eq 2856	. . . . . . 7 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑦 = (1 / 2) ∧ 𝑧 ∈ (0[,]1))) → (2 · 𝑦) = 1)
82	81	oveq1d 6889	. . . . . 6 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑦 = (1 / 2) ∧ 𝑧 ∈ (0[,]1))) → ((2 · 𝑦) − 1) = (1 − 1))
83		1m1e0 11373	. . . . . 6 ⊢ (1 − 1) = 0
84	82, 83	syl6req 2857	. . . . 5 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) ∧ (𝑦 = (1 / 2) ∧ 𝑧 ∈ (0[,]1))) → 0 = ((2 · 𝑦) − 1))
85		retopon 22780	. . . . . . . 8 ⊢ (topGen‘ran (,)) ∈ (TopOn‘ℝ)
86		iccssre 12473	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ (1 / 2) ∈ ℝ) → (0[,](1 / 2)) ⊆ ℝ)
87	64, 68, 86	mp2an 675	. . . . . . . 8 ⊢ (0[,](1 / 2)) ⊆ ℝ
88		resttopon 21179	. . . . . . . 8 ⊢ (((topGen‘ran (,)) ∈ (TopOn‘ℝ) ∧ (0[,](1 / 2)) ⊆ ℝ) → ((topGen‘ran (,)) ↾_t (0[,](1 / 2))) ∈ (TopOn‘(0[,](1 / 2))))
89	85, 87, 88	mp2an 675	. . . . . . 7 ⊢ ((topGen‘ran (,)) ↾_t (0[,](1 / 2))) ∈ (TopOn‘(0[,](1 / 2)))
90	89	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → ((topGen‘ran (,)) ↾_t (0[,](1 / 2))) ∈ (TopOn‘(0[,](1 / 2))))
91	90, 56, 56, 58	cnmpt2c 21687	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑦 ∈ (0[,](1 / 2)), 𝑧 ∈ (0[,]1) ↦ 0) ∈ ((((topGen‘ran (,)) ↾_t (0[,](1 / 2))) ×_t II) Cn II))
92		iccssre 12473	. . . . . . . . 9 ⊢ (((1 / 2) ∈ ℝ ∧ 1 ∈ ℝ) → ((1 / 2)[,]1) ⊆ ℝ)
93	68, 66, 92	mp2an 675	. . . . . . . 8 ⊢ ((1 / 2)[,]1) ⊆ ℝ
94		resttopon 21179	. . . . . . . 8 ⊢ (((topGen‘ran (,)) ∈ (TopOn‘ℝ) ∧ ((1 / 2)[,]1) ⊆ ℝ) → ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) ∈ (TopOn‘((1 / 2)[,]1)))
95	85, 93, 94	mp2an 675	. . . . . . 7 ⊢ ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) ∈ (TopOn‘((1 / 2)[,]1))
96	95	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) ∈ (TopOn‘((1 / 2)[,]1)))
97	96, 56	cnmpt1st 21685	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑦 ∈ ((1 / 2)[,]1), 𝑧 ∈ (0[,]1) ↦ 𝑦) ∈ ((((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) ×_t II) Cn ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1))))
98	62	iihalf2cn 22946	. . . . . . 7 ⊢ (𝑥 ∈ ((1 / 2)[,]1) ↦ ((2 · 𝑥) − 1)) ∈ (((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) Cn II)
99	98	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑥 ∈ ((1 / 2)[,]1) ↦ ((2 · 𝑥) − 1)) ∈ (((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) Cn II))
100		oveq2 6882	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (2 · 𝑥) = (2 · 𝑦))
101	100	oveq1d 6889	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((2 · 𝑥) − 1) = ((2 · 𝑦) − 1))
102	96, 56, 97, 96, 99, 101	cnmpt21 21688	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑦 ∈ ((1 / 2)[,]1), 𝑧 ∈ (0[,]1) ↦ ((2 · 𝑦) − 1)) ∈ ((((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) ×_t II) Cn II))
103	60, 61, 62, 63, 65, 67, 75, 56, 84, 91, 102	cnmpt2pc 22940	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑦 ∈ (0[,]1), 𝑧 ∈ (0[,]1) ↦ if(𝑦 ≤ (1 / 2), 0, ((2 · 𝑦) − 1))) ∈ ((II ×_t II) Cn II))
104		breq1 4847	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦 ≤ (1 / 2) ↔ 𝑥 ≤ (1 / 2)))
105		oveq2 6882	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (2 · 𝑦) = (2 · 𝑥))
106	105	oveq1d 6889	. . . . . 6 ⊢ (𝑦 = 𝑥 → ((2 · 𝑦) − 1) = ((2 · 𝑥) − 1))
107	104, 106	ifbieq2d 4304	. . . . 5 ⊢ (𝑦 = 𝑥 → if(𝑦 ≤ (1 / 2), 0, ((2 · 𝑦) − 1)) = if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)))
108	107	adantr 468	. . . 4 ⊢ ((𝑦 = 𝑥 ∧ 𝑧 = 0) → if(𝑦 ≤ (1 / 2), 0, ((2 · 𝑦) − 1)) = if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)))
109	56, 57, 59, 56, 56, 103, 108	cnmpt12 21684	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1))) ∈ (II Cn II))
110		id 22	. . . . . . 7 ⊢ (𝑥 = 0 → 𝑥 = 0)
111	110, 70	syl6eqbr 4883	. . . . . 6 ⊢ (𝑥 = 0 → 𝑥 ≤ (1 / 2))
112	111, 43	syl 17	. . . . 5 ⊢ (𝑥 = 0 → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) = 0)
113		c0ex 10319	. . . . 5 ⊢ 0 ∈ V
114	112, 47, 113	fvmpt 6503	. . . 4 ⊢ (0 ∈ (0[,]1) → ((𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)))‘0) = 0)
115	8, 114	mp1i 13	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → ((𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)))‘0) = 0)
116		1elunit 12512	. . . 4 ⊢ 1 ∈ (0[,]1)
117	68, 66	ltnlei 10443	. . . . . . . . 9 ⊢ ((1 / 2) < 1 ↔ ¬ 1 ≤ (1 / 2))
118	71, 117	mpbi 221	. . . . . . . 8 ⊢ ¬ 1 ≤ (1 / 2)
119		breq1 4847	. . . . . . . 8 ⊢ (𝑥 = 1 → (𝑥 ≤ (1 / 2) ↔ 1 ≤ (1 / 2)))
120	118, 119	mtbiri 318	. . . . . . 7 ⊢ (𝑥 = 1 → ¬ 𝑥 ≤ (1 / 2))
121	120, 36	syl 17	. . . . . 6 ⊢ (𝑥 = 1 → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) = ((2 · 𝑥) − 1))
122		oveq2 6882	. . . . . . . . 9 ⊢ (𝑥 = 1 → (2 · 𝑥) = (2 · 1))
123		2t1e2 11454	. . . . . . . . 9 ⊢ (2 · 1) = 2
124	122, 123	syl6eq 2856	. . . . . . . 8 ⊢ (𝑥 = 1 → (2 · 𝑥) = 2)
125	124	oveq1d 6889	. . . . . . 7 ⊢ (𝑥 = 1 → ((2 · 𝑥) − 1) = (2 − 1))
126		2m1e1 11418	. . . . . . 7 ⊢ (2 − 1) = 1
127	125, 126	syl6eq 2856	. . . . . 6 ⊢ (𝑥 = 1 → ((2 · 𝑥) − 1) = 1)
128	121, 127	eqtrd 2840	. . . . 5 ⊢ (𝑥 = 1 → if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)) = 1)
129		1ex 10321	. . . . 5 ⊢ 1 ∈ V
130	128, 47, 129	fvmpt 6503	. . . 4 ⊢ (1 ∈ (0[,]1) → ((𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)))‘1) = 1)
131	116, 130	mp1i 13	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → ((𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1)))‘1) = 1)
132	34, 109, 115, 131	reparpht 23010	. 2 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝐹 ∘ (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), 0, ((2 · 𝑥) − 1))))( ≃_ph‘𝐽)𝐹)
133	54, 132	eqbrtrd 4866	1 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = 𝑌) → (𝑃(*_𝑝‘𝐽)𝐹)( ≃_ph‘𝐽)𝐹)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 ∧ w3a 1100 = wceq 1637 ∈ wcel 2156 ⊆ wss 3769 ifcif 4279 {csn 4370 ∪ cuni 4630 class class class wbr 4844 ↦ cmpt 4923 × cxp 5309 ran crn 5312 ∘ ccom 5315 ⟶wf 6097 ‘cfv 6101 (class class class)co 6874 ℝcr 10220 0cc0 10221 1c1 10222 · cmul 10226 < clt 10359 ≤ cle 10360 − cmin 10551 / cdiv 10969 2c2 11356 (,)cioo 12393 [,]cicc 12396 ↾_t crest 16286 topGenctg 16303 Topctop 20911 TopOnctopon 20928 Cn ccn 21242 IIcii 22891 ≃_phcphtpc 22981 *_𝑝cpco 23012

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1877 ax-4 1894 ax-5 2001 ax-6 2068 ax-7 2104 ax-8 2158 ax-9 2165 ax-10 2185 ax-11 2201 ax-12 2214 ax-13 2420 ax-ext 2784 ax-rep 4964 ax-sep 4975 ax-nul 4983 ax-pow 5035 ax-pr 5096 ax-un 7179 ax-inf2 8785 ax-cnex 10277 ax-resscn 10278 ax-1cn 10279 ax-icn 10280 ax-addcl 10281 ax-addrcl 10282 ax-mulcl 10283 ax-mulrcl 10284 ax-mulcom 10285 ax-addass 10286 ax-mulass 10287 ax-distr 10288 ax-i2m1 10289 ax-1ne0 10290 ax-1rid 10291 ax-rnegex 10292 ax-rrecex 10293 ax-cnre 10294 ax-pre-lttri 10295 ax-pre-lttrn 10296 ax-pre-ltadd 10297 ax-pre-mulgt0 10298 ax-pre-sup 10299 ax-addf 10300 ax-mulf 10301

This theorem depends on definitions: df-bi 198 df-an 385 df-or 866 df-3or 1101 df-3an 1102 df-tru 1641 df-ex 1860 df-nf 1864 df-sb 2061 df-eu 2634 df-mo 2635 df-clab 2793 df-cleq 2799 df-clel 2802 df-nfc 2937 df-ne 2979 df-nel 3082 df-ral 3101 df-rex 3102 df-reu 3103 df-rmo 3104 df-rab 3105 df-v 3393 df-sbc 3634 df-csb 3729 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-pss 3785 df-nul 4117 df-if 4280 df-pw 4353 df-sn 4371 df-pr 4373 df-tp 4375 df-op 4377 df-uni 4631 df-int 4670 df-iun 4714 df-iin 4715 df-br 4845 df-opab 4907 df-mpt 4924 df-tr 4947 df-id 5219 df-eprel 5224 df-po 5232 df-so 5233 df-fr 5270 df-se 5271 df-we 5272 df-xp 5317 df-rel 5318 df-cnv 5319 df-co 5320 df-dm 5321 df-rn 5322 df-res 5323 df-ima 5324 df-pred 5893 df-ord 5939 df-on 5940 df-lim 5941 df-suc 5942 df-iota 6064 df-fun 6103 df-fn 6104 df-f 6105 df-f1 6106 df-fo 6107 df-f1o 6108 df-fv 6109 df-isom 6110 df-riota 6835 df-ov 6877 df-oprab 6878 df-mpt2 6879 df-of 7127 df-om 7296 df-1st 7398 df-2nd 7399 df-supp 7530 df-wrecs 7642 df-recs 7704 df-rdg 7742 df-1o 7796 df-2o 7797 df-oadd 7800 df-er 7979 df-map 8094 df-ixp 8146 df-en 8193 df-dom 8194 df-sdom 8195 df-fin 8196 df-fsupp 8515 df-fi 8556 df-sup 8587 df-inf 8588 df-oi 8654 df-card 9048 df-cda 9275 df-pnf 10361 df-mnf 10362 df-xr 10363 df-ltxr 10364 df-le 10365 df-sub 10553 df-neg 10554 df-div 10970 df-nn 11306 df-2 11364 df-3 11365 df-4 11366 df-5 11367 df-6 11368 df-7 11369 df-8 11370 df-9 11371 df-n0 11560 df-z 11644 df-dec 11760 df-uz 11905 df-q 12008 df-rp 12047 df-xneg 12162 df-xadd 12163 df-xmul 12164 df-ioo 12397 df-icc 12400 df-fz 12550 df-fzo 12690 df-seq 13025 df-exp 13084 df-hash 13338 df-cj 14062 df-re 14063 df-im 14064 df-sqrt 14198 df-abs 14199 df-struct 16070 df-ndx 16071 df-slot 16072 df-base 16074 df-sets 16075 df-ress 16076 df-plusg 16166 df-mulr 16167 df-starv 16168 df-sca 16169 df-vsca 16170 df-ip 16171 df-tset 16172 df-ple 16173 df-ds 16175 df-unif 16176 df-hom 16177 df-cco 16178 df-rest 16288 df-topn 16289 df-0g 16307 df-gsum 16308 df-topgen 16309 df-pt 16310 df-prds 16313 df-xrs 16367 df-qtop 16372 df-imas 16373 df-xps 16375 df-mre 16451 df-mrc 16452 df-acs 16454 df-mgm 17447 df-sgrp 17489 df-mnd 17500 df-submnd 17541 df-mulg 17746 df-cntz 17951 df-cmn 18396 df-psmet 19946 df-xmet 19947 df-met 19948 df-bl 19949 df-mopn 19950 df-cnfld 19955 df-top 20912 df-topon 20929 df-topsp 20951 df-bases 20964 df-cld 21037 df-cn 21245 df-cnp 21246 df-tx 21579 df-hmeo 21772 df-xms 22338 df-ms 22339 df-tms 22340 df-ii 22893 df-htpy 22982 df-phtpy 22983 df-phtpc 23004 df-pco 23017

This theorem is referenced by: pcophtb 23041 pi1grplem 23061 pi1xfr 23067 pi1xfrcnvlem 23068

W3C validator