pcopt2 - Metamath Proof Explorer

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

Theorem pcopt2 24939

Description: Concatenation with a point does not affect homotopy class. (Contributed by Mario Carneiro, 12-Feb-2015.)

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

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

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

Step	Hyp	Ref	Expression
1		pcopt.1	. . . . . . . . 9 ⊢ 𝑃 = ((0[,]1) × {𝑌})
2	1	fveq1i 6827	. . . . . . . 8 ⊢ (𝑃‘((2 · 𝑥) − 1)) = (((0[,]1) × {𝑌})‘((2 · 𝑥) − 1))
3		simpr 484	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝐹‘1) = 𝑌)
4		iiuni 24790	. . . . . . . . . . . . 13 ⊢ (0[,]1) = ∪ II
5		eqid 2729	. . . . . . . . . . . . 13 ⊢ ∪ 𝐽 = ∪ 𝐽
6	4, 5	cnf 23149	. . . . . . . . . . . 12 ⊢ (𝐹 ∈ (II Cn 𝐽) → 𝐹:(0[,]1)⟶∪ 𝐽)
7	6	adantr 480	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 𝐹:(0[,]1)⟶∪ 𝐽)
8		1elunit 13391	. . . . . . . . . . 11 ⊢ 1 ∈ (0[,]1)
9		ffvelcdm 7019	. . . . . . . . . . 11 ⊢ ((𝐹:(0[,]1)⟶∪ 𝐽 ∧ 1 ∈ (0[,]1)) → (𝐹‘1) ∈ ∪ 𝐽)
10	7, 8, 9	sylancl 586	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝐹‘1) ∈ ∪ 𝐽)
11	3, 10	eqeltrrd 2829	. . . . . . . . 9 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 𝑌 ∈ ∪ 𝐽)
12		elii2 24848	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2)) → 𝑥 ∈ ((1 / 2)[,]1))
13		iihalf2 24844	. . . . . . . . . 10 ⊢ (𝑥 ∈ ((1 / 2)[,]1) → ((2 · 𝑥) − 1) ∈ (0[,]1))
14	12, 13	syl 17	. . . . . . . . 9 ⊢ ((𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2)) → ((2 · 𝑥) − 1) ∈ (0[,]1))
15		fvconst2g 7142	. . . . . . . . 9 ⊢ ((𝑌 ∈ ∪ 𝐽 ∧ ((2 · 𝑥) − 1) ∈ (0[,]1)) → (((0[,]1) × {𝑌})‘((2 · 𝑥) − 1)) = 𝑌)
16	11, 14, 15	syl2an 596	. . . . . . . 8 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ (𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2))) → (((0[,]1) × {𝑌})‘((2 · 𝑥) − 1)) = 𝑌)
17	2, 16	eqtrid 2776	. . . . . . 7 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ (𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2))) → (𝑃‘((2 · 𝑥) − 1)) = 𝑌)
18		simplr 768	. . . . . . 7 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ (𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2))) → (𝐹‘1) = 𝑌)
19	17, 18	eqtr4d 2767	. . . . . 6 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ (𝑥 ∈ (0[,]1) ∧ ¬ 𝑥 ≤ (1 / 2))) → (𝑃‘((2 · 𝑥) − 1)) = (𝐹‘1))
20	19	anassrs 467	. . . . 5 ⊢ ((((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ 𝑥 ∈ (0[,]1)) ∧ ¬ 𝑥 ≤ (1 / 2)) → (𝑃‘((2 · 𝑥) − 1)) = (𝐹‘1))
21	20	ifeq2da 4511	. . . 4 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ 𝑥 ∈ (0[,]1)) → if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝑃‘((2 · 𝑥) − 1))) = if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐹‘1)))
22	21	mpteq2dva 5188	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝑃‘((2 · 𝑥) − 1)))) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐹‘1))))
23		simpl 482	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 𝐹 ∈ (II Cn 𝐽))
24		cntop2 23144	. . . . . . . 8 ⊢ (𝐹 ∈ (II Cn 𝐽) → 𝐽 ∈ Top)
25	24	adantr 480	. . . . . . 7 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 𝐽 ∈ Top)
26		toptopon2 22821	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
27	25, 26	sylib 218	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 𝐽 ∈ (TopOn‘∪ 𝐽))
28	1	pcoptcl 24937	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝑌 ∈ ∪ 𝐽) → (𝑃 ∈ (II Cn 𝐽) ∧ (𝑃‘0) = 𝑌 ∧ (𝑃‘1) = 𝑌))
29	27, 11, 28	syl2anc 584	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑃 ∈ (II Cn 𝐽) ∧ (𝑃‘0) = 𝑌 ∧ (𝑃‘1) = 𝑌))
30	29	simp1d 1142	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 𝑃 ∈ (II Cn 𝐽))
31	23, 30	pcoval 24927	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝐹(*_𝑝‘𝐽)𝑃) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝑃‘((2 · 𝑥) − 1)))))
32		iftrue 4484	. . . . . . . . 9 ⊢ (𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) = (2 · 𝑥))
33	32	adantl 481	. . . . . . . 8 ⊢ ((𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2)) → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) = (2 · 𝑥))
34		elii1 24847	. . . . . . . . 9 ⊢ (𝑥 ∈ (0[,](1 / 2)) ↔ (𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2)))
35		iihalf1 24841	. . . . . . . . 9 ⊢ (𝑥 ∈ (0[,](1 / 2)) → (2 · 𝑥) ∈ (0[,]1))
36	34, 35	sylbir 235	. . . . . . . 8 ⊢ ((𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2)) → (2 · 𝑥) ∈ (0[,]1))
37	33, 36	eqeltrd 2828	. . . . . . 7 ⊢ ((𝑥 ∈ (0[,]1) ∧ 𝑥 ≤ (1 / 2)) → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) ∈ (0[,]1))
38	37	ex 412	. . . . . 6 ⊢ (𝑥 ∈ (0[,]1) → (𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) ∈ (0[,]1)))
39		iffalse 4487	. . . . . . 7 ⊢ (¬ 𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) = 1)
40	39, 8	eqeltrdi 2836	. . . . . 6 ⊢ (¬ 𝑥 ≤ (1 / 2) → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) ∈ (0[,]1))
41	38, 40	pm2.61d1 180	. . . . 5 ⊢ (𝑥 ∈ (0[,]1) → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) ∈ (0[,]1))
42	41	adantl 481	. . . 4 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ 𝑥 ∈ (0[,]1)) → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) ∈ (0[,]1))
43		eqidd 2730	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1)) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1)))
44	7	feqmptd 6895	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 𝐹 = (𝑦 ∈ (0[,]1) ↦ (𝐹‘𝑦)))
45		fveq2 6826	. . . . 5 ⊢ (𝑦 = if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) → (𝐹‘𝑦) = (𝐹‘if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1)))
46		fvif 6842	. . . . 5 ⊢ (𝐹‘if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1)) = if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐹‘1))
47	45, 46	eqtrdi 2780	. . . 4 ⊢ (𝑦 = if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) → (𝐹‘𝑦) = if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐹‘1)))
48	42, 43, 44, 47	fmptco 7067	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝐹 ∘ (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1))) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (𝐹‘(2 · 𝑥)), (𝐹‘1))))
49	22, 31, 48	3eqtr4d 2774	. 2 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝐹(*_𝑝‘𝐽)𝑃) = (𝐹 ∘ (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1))))
50		iitopon 24788	. . . . 5 ⊢ II ∈ (TopOn‘(0[,]1))
51	50	a1i 11	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → II ∈ (TopOn‘(0[,]1)))
52	51	cnmptid 23564	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ 𝑥) ∈ (II Cn II))
53		0elunit 13390	. . . . . 6 ⊢ 0 ∈ (0[,]1)
54	53	a1i 11	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 0 ∈ (0[,]1))
55	51, 51, 54	cnmptc 23565	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ 0) ∈ (II Cn II))
56		eqid 2729	. . . . 5 ⊢ (topGen‘ran (,)) = (topGen‘ran (,))
57		eqid 2729	. . . . 5 ⊢ ((topGen‘ran (,)) ↾_t (0[,](1 / 2))) = ((topGen‘ran (,)) ↾_t (0[,](1 / 2)))
58		eqid 2729	. . . . 5 ⊢ ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) = ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1))
59		dfii2 24791	. . . . 5 ⊢ II = ((topGen‘ran (,)) ↾_t (0[,]1))
60		0re 11136	. . . . . 6 ⊢ 0 ∈ ℝ
61	60	a1i 11	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 0 ∈ ℝ)
62		1re 11134	. . . . . 6 ⊢ 1 ∈ ℝ
63	62	a1i 11	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 1 ∈ ℝ)
64		halfre 12355	. . . . . . 7 ⊢ (1 / 2) ∈ ℝ
65		halfge0 12358	. . . . . . 7 ⊢ 0 ≤ (1 / 2)
66		halflt1 12359	. . . . . . . 8 ⊢ (1 / 2) < 1
67	64, 62, 66	ltleii 11257	. . . . . . 7 ⊢ (1 / 2) ≤ 1
68		elicc01 13387	. . . . . . 7 ⊢ ((1 / 2) ∈ (0[,]1) ↔ ((1 / 2) ∈ ℝ ∧ 0 ≤ (1 / 2) ∧ (1 / 2) ≤ 1))
69	64, 65, 67, 68	mpbir3an 1342	. . . . . 6 ⊢ (1 / 2) ∈ (0[,]1)
70	69	a1i 11	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (1 / 2) ∈ (0[,]1))
71		simprl 770	. . . . . . 7 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ (𝑦 = (1 / 2) ∧ 𝑧 ∈ (0[,]1))) → 𝑦 = (1 / 2))
72	71	oveq2d 7369	. . . . . 6 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ (𝑦 = (1 / 2) ∧ 𝑧 ∈ (0[,]1))) → (2 · 𝑦) = (2 · (1 / 2)))
73		2cn 12221	. . . . . . 7 ⊢ 2 ∈ ℂ
74		2ne0 12250	. . . . . . 7 ⊢ 2 ≠ 0
75	73, 74	recidi 11873	. . . . . 6 ⊢ (2 · (1 / 2)) = 1
76	72, 75	eqtrdi 2780	. . . . 5 ⊢ (((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) ∧ (𝑦 = (1 / 2) ∧ 𝑧 ∈ (0[,]1))) → (2 · 𝑦) = 1)
77		retopon 24667	. . . . . . . 8 ⊢ (topGen‘ran (,)) ∈ (TopOn‘ℝ)
78		iccssre 13350	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ (1 / 2) ∈ ℝ) → (0[,](1 / 2)) ⊆ ℝ)
79	60, 64, 78	mp2an 692	. . . . . . . 8 ⊢ (0[,](1 / 2)) ⊆ ℝ
80		resttopon 23064	. . . . . . . 8 ⊢ (((topGen‘ran (,)) ∈ (TopOn‘ℝ) ∧ (0[,](1 / 2)) ⊆ ℝ) → ((topGen‘ran (,)) ↾_t (0[,](1 / 2))) ∈ (TopOn‘(0[,](1 / 2))))
81	77, 79, 80	mp2an 692	. . . . . . 7 ⊢ ((topGen‘ran (,)) ↾_t (0[,](1 / 2))) ∈ (TopOn‘(0[,](1 / 2)))
82	81	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → ((topGen‘ran (,)) ↾_t (0[,](1 / 2))) ∈ (TopOn‘(0[,](1 / 2))))
83	82, 51	cnmpt1st 23571	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑦 ∈ (0[,](1 / 2)), 𝑧 ∈ (0[,]1) ↦ 𝑦) ∈ ((((topGen‘ran (,)) ↾_t (0[,](1 / 2))) ×_t II) Cn ((topGen‘ran (,)) ↾_t (0[,](1 / 2)))))
84	57	iihalf1cn 24842	. . . . . . 7 ⊢ (𝑥 ∈ (0[,](1 / 2)) ↦ (2 · 𝑥)) ∈ (((topGen‘ran (,)) ↾_t (0[,](1 / 2))) Cn II)
85	84	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑥 ∈ (0[,](1 / 2)) ↦ (2 · 𝑥)) ∈ (((topGen‘ran (,)) ↾_t (0[,](1 / 2))) Cn II))
86		oveq2 7361	. . . . . 6 ⊢ (𝑥 = 𝑦 → (2 · 𝑥) = (2 · 𝑦))
87	82, 51, 83, 82, 85, 86	cnmpt21 23574	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑦 ∈ (0[,](1 / 2)), 𝑧 ∈ (0[,]1) ↦ (2 · 𝑦)) ∈ ((((topGen‘ran (,)) ↾_t (0[,](1 / 2))) ×_t II) Cn II))
88		iccssre 13350	. . . . . . . . 9 ⊢ (((1 / 2) ∈ ℝ ∧ 1 ∈ ℝ) → ((1 / 2)[,]1) ⊆ ℝ)
89	64, 62, 88	mp2an 692	. . . . . . . 8 ⊢ ((1 / 2)[,]1) ⊆ ℝ
90		resttopon 23064	. . . . . . . 8 ⊢ (((topGen‘ran (,)) ∈ (TopOn‘ℝ) ∧ ((1 / 2)[,]1) ⊆ ℝ) → ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) ∈ (TopOn‘((1 / 2)[,]1)))
91	77, 89, 90	mp2an 692	. . . . . . 7 ⊢ ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) ∈ (TopOn‘((1 / 2)[,]1))
92	91	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → ((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) ∈ (TopOn‘((1 / 2)[,]1)))
93	8	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → 1 ∈ (0[,]1))
94	92, 51, 51, 93	cnmpt2c 23573	. . . . 5 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑦 ∈ ((1 / 2)[,]1), 𝑧 ∈ (0[,]1) ↦ 1) ∈ ((((topGen‘ran (,)) ↾_t ((1 / 2)[,]1)) ×_t II) Cn II))
95	56, 57, 58, 59, 61, 63, 70, 51, 76, 87, 94	cnmpopc 24838	. . . 4 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑦 ∈ (0[,]1), 𝑧 ∈ (0[,]1) ↦ if(𝑦 ≤ (1 / 2), (2 · 𝑦), 1)) ∈ ((II ×_t II) Cn II))
96		breq1 5098	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦 ≤ (1 / 2) ↔ 𝑥 ≤ (1 / 2)))
97		oveq2 7361	. . . . . 6 ⊢ (𝑦 = 𝑥 → (2 · 𝑦) = (2 · 𝑥))
98	96, 97	ifbieq1d 4503	. . . . 5 ⊢ (𝑦 = 𝑥 → if(𝑦 ≤ (1 / 2), (2 · 𝑦), 1) = if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1))
99	98	adantr 480	. . . 4 ⊢ ((𝑦 = 𝑥 ∧ 𝑧 = 0) → if(𝑦 ≤ (1 / 2), (2 · 𝑦), 1) = if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1))
100	51, 52, 55, 51, 51, 95, 99	cnmpt12 23570	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1)) ∈ (II Cn II))
101		id 22	. . . . . . . 8 ⊢ (𝑥 = 0 → 𝑥 = 0)
102	101, 65	eqbrtrdi 5134	. . . . . . 7 ⊢ (𝑥 = 0 → 𝑥 ≤ (1 / 2))
103	102, 32	syl 17	. . . . . 6 ⊢ (𝑥 = 0 → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) = (2 · 𝑥))
104		oveq2 7361	. . . . . . 7 ⊢ (𝑥 = 0 → (2 · 𝑥) = (2 · 0))
105		2t0e0 12310	. . . . . . 7 ⊢ (2 · 0) = 0
106	104, 105	eqtrdi 2780	. . . . . 6 ⊢ (𝑥 = 0 → (2 · 𝑥) = 0)
107	103, 106	eqtrd 2764	. . . . 5 ⊢ (𝑥 = 0 → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) = 0)
108		eqid 2729	. . . . 5 ⊢ (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1)) = (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1))
109		c0ex 11128	. . . . 5 ⊢ 0 ∈ V
110	107, 108, 109	fvmpt 6934	. . . 4 ⊢ (0 ∈ (0[,]1) → ((𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1))‘0) = 0)
111	53, 110	mp1i 13	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → ((𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1))‘0) = 0)
112	64, 62	ltnlei 11255	. . . . . . . 8 ⊢ ((1 / 2) < 1 ↔ ¬ 1 ≤ (1 / 2))
113	66, 112	mpbi 230	. . . . . . 7 ⊢ ¬ 1 ≤ (1 / 2)
114		breq1 5098	. . . . . . 7 ⊢ (𝑥 = 1 → (𝑥 ≤ (1 / 2) ↔ 1 ≤ (1 / 2)))
115	113, 114	mtbiri 327	. . . . . 6 ⊢ (𝑥 = 1 → ¬ 𝑥 ≤ (1 / 2))
116	115, 39	syl 17	. . . . 5 ⊢ (𝑥 = 1 → if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1) = 1)
117		1ex 11130	. . . . 5 ⊢ 1 ∈ V
118	116, 108, 117	fvmpt 6934	. . . 4 ⊢ (1 ∈ (0[,]1) → ((𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1))‘1) = 1)
119	8, 118	mp1i 13	. . 3 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → ((𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1))‘1) = 1)
120	23, 100, 111, 119	reparpht 24914	. 2 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝐹 ∘ (𝑥 ∈ (0[,]1) ↦ if(𝑥 ≤ (1 / 2), (2 · 𝑥), 1)))( ≃_ph‘𝐽)𝐹)
121	49, 120	eqbrtrd 5117	1 ⊢ ((𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘1) = 𝑌) → (𝐹(*_𝑝‘𝐽)𝑃)( ≃_ph‘𝐽)𝐹)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ⊆ wss 3905 ifcif 4478 {csn 4579 ∪ cuni 4861 class class class wbr 5095 ↦ cmpt 5176 × cxp 5621 ran crn 5624 ∘ ccom 5627 ⟶wf 6482 ‘cfv 6486 (class class class)co 7353 ℝcr 11027 0cc0 11028 1c1 11029 · cmul 11033 < clt 11168 ≤ cle 11169 − cmin 11365 / cdiv 11795 2c2 12201 (,)cioo 13266 [,]cicc 13269 ↾_t crest 17342 topGenctg 17359 Topctop 22796 TopOnctopon 22813 Cn ccn 23127 IIcii 24784 ≃_phcphtpc 24884 *_𝑝cpco 24916

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 ax-addf 11107

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4862 df-int 4900 df-iun 4946 df-iin 4947 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-se 5577 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-isom 6495 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-of 7617 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8101 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8632 df-map 8762 df-ixp 8832 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-fsupp 9271 df-fi 9320 df-sup 9351 df-inf 9352 df-oi 9421 df-card 9854 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-div 11796 df-nn 12147 df-2 12209 df-3 12210 df-4 12211 df-5 12212 df-6 12213 df-7 12214 df-8 12215 df-9 12216 df-n0 12403 df-z 12490 df-dec 12610 df-uz 12754 df-q 12868 df-rp 12912 df-xneg 13032 df-xadd 13033 df-xmul 13034 df-ioo 13270 df-icc 13273 df-fz 13429 df-fzo 13576 df-seq 13927 df-exp 13987 df-hash 14256 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17139 df-ress 17160 df-plusg 17192 df-mulr 17193 df-starv 17194 df-sca 17195 df-vsca 17196 df-ip 17197 df-tset 17198 df-ple 17199 df-ds 17201 df-unif 17202 df-hom 17203 df-cco 17204 df-rest 17344 df-topn 17345 df-0g 17363 df-gsum 17364 df-topgen 17365 df-pt 17366 df-prds 17369 df-xrs 17424 df-qtop 17429 df-imas 17430 df-xps 17432 df-mre 17506 df-mrc 17507 df-acs 17509 df-mgm 18532 df-sgrp 18611 df-mnd 18627 df-submnd 18676 df-mulg 18965 df-cntz 19214 df-cmn 19679 df-psmet 21271 df-xmet 21272 df-met 21273 df-bl 21274 df-mopn 21275 df-cnfld 21280 df-top 22797 df-topon 22814 df-topsp 22836 df-bases 22849 df-cld 22922 df-cn 23130 df-cnp 23131 df-tx 23465 df-hmeo 23658 df-xms 24224 df-ms 24225 df-tms 24226 df-ii 24786 df-htpy 24885 df-phtpy 24886 df-phtpc 24907 df-pco 24921

This theorem is referenced by: pcophtb 24945 pi1xfrcnvlem 24972

W3C validator