refsum2cnlem1 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > refsum2cnlem1		Structured version Visualization version GIF version

Theorem refsum2cnlem1 43706

Description: This is the core Lemma for refsum2cn 43707: the sum of two continuous real functions (from a common topological space) is continuous. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

**Hypotheses**
Ref	Expression
refsum2cnlem1.1	⊢ Ⅎ𝑥𝐴
refsum2cnlem1.2	⊢ Ⅎ𝑥𝐹
refsum2cnlem1.3	⊢ Ⅎ𝑥𝐺
refsum2cnlem1.4	⊢ Ⅎ𝑥𝜑
refsum2cnlem1.5	⊢ 𝐴 = (𝑘 ∈ {1, 2} ↦ if(𝑘 = 1, 𝐹, 𝐺))
refsum2cnlem1.6	⊢ 𝐾 = (topGen‘ran (,))
refsum2cnlem1.7	⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
refsum2cnlem1.8	⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
refsum2cnlem1.9	⊢ (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾))

**Assertion**
Ref	Expression
refsum2cnlem1	⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ ((𝐹‘𝑥) + (𝐺‘𝑥))) ∈ (𝐽 Cn 𝐾))

Distinct variable groups: 𝑥,𝑘,𝐽 𝑘,𝐹 𝑘,𝐺 𝑘,𝐾,𝑥 𝑘,𝑋,𝑥 𝜑,𝑘 Allowed substitution hints: 𝜑(𝑥) 𝐴(𝑥,𝑘) 𝐹(𝑥) 𝐺(𝑥)

**Proof of Theorem refsum2cnlem1**
Step	Hyp	Ref	Expression
1		refsum2cnlem1.4	. . 3 ⊢ Ⅎ𝑥𝜑
2		refsum2cnlem1.5	. . . . . . . . 9 ⊢ 𝐴 = (𝑘 ∈ {1, 2} ↦ if(𝑘 = 1, 𝐹, 𝐺))
3		nfmpt1 5255	. . . . . . . . 9 ⊢ Ⅎ𝑘(𝑘 ∈ {1, 2} ↦ if(𝑘 = 1, 𝐹, 𝐺))
4	2, 3	nfcxfr 2901	. . . . . . . 8 ⊢ Ⅎ𝑘𝐴
5		nfcv 2903	. . . . . . . 8 ⊢ Ⅎ𝑘1
6	4, 5	nffv 6898	. . . . . . 7 ⊢ Ⅎ𝑘(𝐴‘1)
7		nfcv 2903	. . . . . . 7 ⊢ Ⅎ𝑘𝑥
8	6, 7	nffv 6898	. . . . . 6 ⊢ Ⅎ𝑘((𝐴‘1)‘𝑥)
9	8	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Ⅎ𝑘((𝐴‘1)‘𝑥))
10		nfcv 2903	. . . . . . . 8 ⊢ Ⅎ𝑘2
11	4, 10	nffv 6898	. . . . . . 7 ⊢ Ⅎ𝑘(𝐴‘2)
12	11, 7	nffv 6898	. . . . . 6 ⊢ Ⅎ𝑘((𝐴‘2)‘𝑥)
13	12	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Ⅎ𝑘((𝐴‘2)‘𝑥))
14		1cnd 11205	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 1 ∈ ℂ)
15		2cnd 12286	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 2 ∈ ℂ)
16		1ex 11206	. . . . . . . . . . 11 ⊢ 1 ∈ V
17	16	prid1 4765	. . . . . . . . . 10 ⊢ 1 ∈ {1, 2}
18		refsum2cnlem1.8	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
19		refsum2cnlem1.9	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾))
20	18, 19	ifcld 4573	. . . . . . . . . 10 ⊢ (𝜑 → if(1 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾))
21		eqeq1 2736	. . . . . . . . . . . 12 ⊢ (𝑘 = 1 → (𝑘 = 1 ↔ 1 = 1))
22	21	ifbid 4550	. . . . . . . . . . 11 ⊢ (𝑘 = 1 → if(𝑘 = 1, 𝐹, 𝐺) = if(1 = 1, 𝐹, 𝐺))
23	22, 2	fvmptg 6993	. . . . . . . . . 10 ⊢ ((1 ∈ {1, 2} ∧ if(1 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾)) → (𝐴‘1) = if(1 = 1, 𝐹, 𝐺))
24	17, 20, 23	sylancr 587	. . . . . . . . 9 ⊢ (𝜑 → (𝐴‘1) = if(1 = 1, 𝐹, 𝐺))
25		eqid 2732	. . . . . . . . . 10 ⊢ 1 = 1
26	25	iftruei 4534	. . . . . . . . 9 ⊢ if(1 = 1, 𝐹, 𝐺) = 𝐹
27	24, 26	eqtrdi 2788	. . . . . . . 8 ⊢ (𝜑 → (𝐴‘1) = 𝐹)
28	27	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐴‘1) = 𝐹)
29	28	fveq1d 6890	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐴‘1)‘𝑥) = (𝐹‘𝑥))
30		eqid 2732	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
31		eqid 2732	. . . . . . . . . . 11 ⊢ ∪ 𝐾 = ∪ 𝐾
32	30, 31	cnf 22741	. . . . . . . . . 10 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾)
33	18, 32	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:∪ 𝐽⟶∪ 𝐾)
34		refsum2cnlem1.7	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
35		toponuni 22407	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
36	34, 35	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 = ∪ 𝐽)
37	36	eqcomd 2738	. . . . . . . . . 10 ⊢ (𝜑 → ∪ 𝐽 = 𝑋)
38		refsum2cnlem1.6	. . . . . . . . . . . . 13 ⊢ 𝐾 = (topGen‘ran (,))
39	38	unieqi 4920	. . . . . . . . . . . 12 ⊢ ∪ 𝐾 = ∪ (topGen‘ran (,))
40		uniretop 24270	. . . . . . . . . . . 12 ⊢ ℝ = ∪ (topGen‘ran (,))
41	39, 40	eqtr4i 2763	. . . . . . . . . . 11 ⊢ ∪ 𝐾 = ℝ
42	41	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → ∪ 𝐾 = ℝ)
43	37, 42	feq23d 6709	. . . . . . . . 9 ⊢ (𝜑 → (𝐹:∪ 𝐽⟶∪ 𝐾 ↔ 𝐹:𝑋⟶ℝ))
44	33, 43	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ)
45	44	anim1i 615	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹:𝑋⟶ℝ ∧ 𝑥 ∈ 𝑋))
46		ffvelcdm 7080	. . . . . . 7 ⊢ ((𝐹:𝑋⟶ℝ ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℝ)
47		recn 11196	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ ℝ → (𝐹‘𝑥) ∈ ℂ)
48	45, 46, 47	3syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℂ)
49	29, 48	eqeltrd 2833	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐴‘1)‘𝑥) ∈ ℂ)
50		2ex 12285	. . . . . . . . . . 11 ⊢ 2 ∈ V
51	50	prid2 4766	. . . . . . . . . 10 ⊢ 2 ∈ {1, 2}
52	18, 19	ifcld 4573	. . . . . . . . . 10 ⊢ (𝜑 → if(2 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾))
53		eqeq1 2736	. . . . . . . . . . . 12 ⊢ (𝑘 = 2 → (𝑘 = 1 ↔ 2 = 1))
54	53	ifbid 4550	. . . . . . . . . . 11 ⊢ (𝑘 = 2 → if(𝑘 = 1, 𝐹, 𝐺) = if(2 = 1, 𝐹, 𝐺))
55	54, 2	fvmptg 6993	. . . . . . . . . 10 ⊢ ((2 ∈ {1, 2} ∧ if(2 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾)) → (𝐴‘2) = if(2 = 1, 𝐹, 𝐺))
56	51, 52, 55	sylancr 587	. . . . . . . . 9 ⊢ (𝜑 → (𝐴‘2) = if(2 = 1, 𝐹, 𝐺))
57		1ne2 12416	. . . . . . . . . . 11 ⊢ 1 ≠ 2
58	57	nesymi 2998	. . . . . . . . . 10 ⊢ ¬ 2 = 1
59	58	iffalsei 4537	. . . . . . . . 9 ⊢ if(2 = 1, 𝐹, 𝐺) = 𝐺
60	56, 59	eqtrdi 2788	. . . . . . . 8 ⊢ (𝜑 → (𝐴‘2) = 𝐺)
61	60	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐴‘2) = 𝐺)
62	61	fveq1d 6890	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐴‘2)‘𝑥) = (𝐺‘𝑥))
63	30, 31	cnf 22741	. . . . . . . . . 10 ⊢ (𝐺 ∈ (𝐽 Cn 𝐾) → 𝐺:∪ 𝐽⟶∪ 𝐾)
64	19, 63	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:∪ 𝐽⟶∪ 𝐾)
65	37, 42	feq23d 6709	. . . . . . . . 9 ⊢ (𝜑 → (𝐺:∪ 𝐽⟶∪ 𝐾 ↔ 𝐺:𝑋⟶ℝ))
66	64, 65	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → 𝐺:𝑋⟶ℝ)
67	66	anim1i 615	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺:𝑋⟶ℝ ∧ 𝑥 ∈ 𝑋))
68		ffvelcdm 7080	. . . . . . 7 ⊢ ((𝐺:𝑋⟶ℝ ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) ∈ ℝ)
69		recn 11196	. . . . . . 7 ⊢ ((𝐺‘𝑥) ∈ ℝ → (𝐺‘𝑥) ∈ ℂ)
70	67, 68, 69	3syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) ∈ ℂ)
71	62, 70	eqeltrd 2833	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐴‘2)‘𝑥) ∈ ℂ)
72	57	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 1 ≠ 2)
73		fveq2 6888	. . . . . . 7 ⊢ (𝑘 = 1 → (𝐴‘𝑘) = (𝐴‘1))
74	73	fveq1d 6890	. . . . . 6 ⊢ (𝑘 = 1 → ((𝐴‘𝑘)‘𝑥) = ((𝐴‘1)‘𝑥))
75	74	adantl 482	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑘 = 1) → ((𝐴‘𝑘)‘𝑥) = ((𝐴‘1)‘𝑥))
76		fveq2 6888	. . . . . . 7 ⊢ (𝑘 = 2 → (𝐴‘𝑘) = (𝐴‘2))
77	76	fveq1d 6890	. . . . . 6 ⊢ (𝑘 = 2 → ((𝐴‘𝑘)‘𝑥) = ((𝐴‘2)‘𝑥))
78	77	adantl 482	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑘 = 2) → ((𝐴‘𝑘)‘𝑥) = ((𝐴‘2)‘𝑥))
79	9, 13, 14, 15, 49, 71, 72, 75, 78	sumpair 43704	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Σ𝑘 ∈ {1, 2} ((𝐴‘𝑘)‘𝑥) = (((𝐴‘1)‘𝑥) + ((𝐴‘2)‘𝑥)))
80	29, 62	oveq12d 7423	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (((𝐴‘1)‘𝑥) + ((𝐴‘2)‘𝑥)) = ((𝐹‘𝑥) + (𝐺‘𝑥)))
81	79, 80	eqtrd 2772	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Σ𝑘 ∈ {1, 2} ((𝐴‘𝑘)‘𝑥) = ((𝐹‘𝑥) + (𝐺‘𝑥)))
82	1, 81	mpteq2da 5245	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ Σ𝑘 ∈ {1, 2} ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ ((𝐹‘𝑥) + (𝐺‘𝑥))))
83		prfi 9318	. . . 4 ⊢ {1, 2} ∈ Fin
84	83	a1i 11	. . 3 ⊢ (𝜑 → {1, 2} ∈ Fin)
85		eqid 2732	. . . . . . . . . 10 ⊢ 𝑋 = 𝑋
86	85	ax-gen 1797	. . . . . . . . 9 ⊢ ∀𝑥 𝑋 = 𝑋
87		refsum2cnlem1.1	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝐴
88		nfcv 2903	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑘
89	87, 88	nffv 6898	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝐴‘𝑘)
90		refsum2cnlem1.2	. . . . . . . . . . 11 ⊢ Ⅎ𝑥𝐹
91	89, 90	nfeq 2916	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝐴‘𝑘) = 𝐹
92		fveq1 6887	. . . . . . . . . . 11 ⊢ ((𝐴‘𝑘) = 𝐹 → ((𝐴‘𝑘)‘𝑥) = (𝐹‘𝑥))
93	92	a1d 25	. . . . . . . . . 10 ⊢ ((𝐴‘𝑘) = 𝐹 → (𝑥 ∈ 𝑋 → ((𝐴‘𝑘)‘𝑥) = (𝐹‘𝑥)))
94	91, 93	ralrimi 3254	. . . . . . . . 9 ⊢ ((𝐴‘𝑘) = 𝐹 → ∀𝑥 ∈ 𝑋 ((𝐴‘𝑘)‘𝑥) = (𝐹‘𝑥))
95		mpteq12f 5235	. . . . . . . . 9 ⊢ ((∀𝑥 𝑋 = 𝑋 ∧ ∀𝑥 ∈ 𝑋 ((𝐴‘𝑘)‘𝑥) = (𝐹‘𝑥)) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
96	86, 94, 95	sylancr 587	. . . . . . . 8 ⊢ ((𝐴‘𝑘) = 𝐹 → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
97	96	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
98		retopon 24271	. . . . . . . . . . . . 13 ⊢ (topGen‘ran (,)) ∈ (TopOn‘ℝ)
99	38, 98	eqeltri 2829	. . . . . . . . . . . 12 ⊢ 𝐾 ∈ (TopOn‘ℝ)
100	99	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘ℝ))
101		cnf2 22744	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘ℝ) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋⟶ℝ)
102	34, 100, 18, 101	syl3anc 1371	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ)
103	102	ffnd 6715	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 Fn 𝑋)
104	90	dffn5f 6960	. . . . . . . . 9 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹 = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
105	103, 104	sylib 217	. . . . . . . 8 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
106	105	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → 𝐹 = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
107	97, 106	eqtr4d 2775	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = 𝐹)
108	18	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → 𝐹 ∈ (𝐽 Cn 𝐾))
109	107, 108	eqeltrd 2833	. . . . 5 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
110	109	adantlr 713	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ (𝐴‘𝑘) = 𝐹) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
111		refsum2cnlem1.3	. . . . . . . . . . 11 ⊢ Ⅎ𝑥𝐺
112	89, 111	nfeq 2916	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝐴‘𝑘) = 𝐺
113		fveq1 6887	. . . . . . . . . . 11 ⊢ ((𝐴‘𝑘) = 𝐺 → ((𝐴‘𝑘)‘𝑥) = (𝐺‘𝑥))
114	113	a1d 25	. . . . . . . . . 10 ⊢ ((𝐴‘𝑘) = 𝐺 → (𝑥 ∈ 𝑋 → ((𝐴‘𝑘)‘𝑥) = (𝐺‘𝑥)))
115	112, 114	ralrimi 3254	. . . . . . . . 9 ⊢ ((𝐴‘𝑘) = 𝐺 → ∀𝑥 ∈ 𝑋 ((𝐴‘𝑘)‘𝑥) = (𝐺‘𝑥))
116		mpteq12f 5235	. . . . . . . . 9 ⊢ ((∀𝑥 𝑋 = 𝑋 ∧ ∀𝑥 ∈ 𝑋 ((𝐴‘𝑘)‘𝑥) = (𝐺‘𝑥)) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
117	86, 115, 116	sylancr 587	. . . . . . . 8 ⊢ ((𝐴‘𝑘) = 𝐺 → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
118	117	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
119		cnf2 22744	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘ℝ) ∧ 𝐺 ∈ (𝐽 Cn 𝐾)) → 𝐺:𝑋⟶ℝ)
120	34, 100, 19, 119	syl3anc 1371	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺:𝑋⟶ℝ)
121	120	ffnd 6715	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 Fn 𝑋)
122	111	dffn5f 6960	. . . . . . . . 9 ⊢ (𝐺 Fn 𝑋 ↔ 𝐺 = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
123	121, 122	sylib 217	. . . . . . . 8 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
124	123	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → 𝐺 = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
125	118, 124	eqtr4d 2775	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = 𝐺)
126	19	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → 𝐺 ∈ (𝐽 Cn 𝐾))
127	125, 126	eqeltrd 2833	. . . . 5 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
128	127	adantlr 713	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ (𝐴‘𝑘) = 𝐺) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
129		simpr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → 𝑘 ∈ {1, 2})
130	18, 19	ifcld 4573	. . . . . . . . 9 ⊢ (𝜑 → if(𝑘 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾))
131	130	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → if(𝑘 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾))
132	2	fvmpt2 7006	. . . . . . . 8 ⊢ ((𝑘 ∈ {1, 2} ∧ if(𝑘 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾)) → (𝐴‘𝑘) = if(𝑘 = 1, 𝐹, 𝐺))
133	129, 131, 132	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → (𝐴‘𝑘) = if(𝑘 = 1, 𝐹, 𝐺))
134		iftrue 4533	. . . . . . 7 ⊢ (𝑘 = 1 → if(𝑘 = 1, 𝐹, 𝐺) = 𝐹)
135	133, 134	sylan9eq 2792	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 1) → (𝐴‘𝑘) = 𝐹)
136	135	orcd 871	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 1) → ((𝐴‘𝑘) = 𝐹 ∨ (𝐴‘𝑘) = 𝐺))
137	133	adantr 481	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → (𝐴‘𝑘) = if(𝑘 = 1, 𝐹, 𝐺))
138		neeq2 3004	. . . . . . . . . . . 12 ⊢ (𝑘 = 2 → (1 ≠ 𝑘 ↔ 1 ≠ 2))
139	57, 138	mpbiri 257	. . . . . . . . . . 11 ⊢ (𝑘 = 2 → 1 ≠ 𝑘)
140	139	necomd 2996	. . . . . . . . . 10 ⊢ (𝑘 = 2 → 𝑘 ≠ 1)
141	140	neneqd 2945	. . . . . . . . 9 ⊢ (𝑘 = 2 → ¬ 𝑘 = 1)
142	141	adantl 482	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → ¬ 𝑘 = 1)
143	142	iffalsed 4538	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → if(𝑘 = 1, 𝐹, 𝐺) = 𝐺)
144	137, 143	eqtrd 2772	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → (𝐴‘𝑘) = 𝐺)
145	144	olcd 872	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → ((𝐴‘𝑘) = 𝐹 ∨ (𝐴‘𝑘) = 𝐺))
146		elpri 4649	. . . . . 6 ⊢ (𝑘 ∈ {1, 2} → (𝑘 = 1 ∨ 𝑘 = 2))
147	146	adantl 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → (𝑘 = 1 ∨ 𝑘 = 2))
148	136, 145, 147	mpjaodan 957	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → ((𝐴‘𝑘) = 𝐹 ∨ (𝐴‘𝑘) = 𝐺))
149	110, 128, 148	mpjaodan 957	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
150	1, 38, 34, 84, 149	refsumcn 43699	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ Σ𝑘 ∈ {1, 2} ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
151	82, 150	eqeltrrd 2834	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ ((𝐹‘𝑥) + (𝐺‘𝑥))) ∈ (𝐽 Cn 𝐾))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∨ wo 845 ∀wal 1539 = wceq 1541 Ⅎwnf 1785 ∈ wcel 2106 Ⅎwnfc 2883 ≠ wne 2940 ∀wral 3061 ifcif 4527 {cpr 4629 ∪ cuni 4907 ↦ cmpt 5230 ran crn 5676 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 Fincfn 8935 ℂcc 11104 ℝcr 11105 1c1 11107 + caddc 11109 2c2 12263 (,)cioo 13320 Σcsu 15628 topGenctg 17379 TopOnctopon 22403 Cn ccn 22719

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-inf2 9632 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 ax-addf 11185

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 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 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-of 7666 df-om 7852 df-1st 7971 df-2nd 7972 df-supp 8143 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-2o 8463 df-er 8699 df-map 8818 df-ixp 8888 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fsupp 9358 df-fi 9402 df-sup 9433 df-inf 9434 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-q 12929 df-rp 12971 df-xneg 13088 df-xadd 13089 df-xmul 13090 df-ioo 13324 df-icc 13327 df-fz 13481 df-fzo 13624 df-seq 13963 df-exp 14024 df-hash 14287 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-clim 15428 df-sum 15629 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-starv 17208 df-sca 17209 df-vsca 17210 df-ip 17211 df-tset 17212 df-ple 17213 df-ds 17215 df-unif 17216 df-hom 17217 df-cco 17218 df-rest 17364 df-topn 17365 df-0g 17383 df-gsum 17384 df-topgen 17385 df-pt 17386 df-prds 17389 df-xrs 17444 df-qtop 17449 df-imas 17450 df-xps 17452 df-mre 17526 df-mrc 17527 df-acs 17529 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-submnd 18668 df-mulg 18945 df-cntz 19175 df-cmn 19644 df-psmet 20928 df-xmet 20929 df-met 20930 df-bl 20931 df-mopn 20932 df-cnfld 20937 df-top 22387 df-topon 22404 df-topsp 22426 df-bases 22440 df-cn 22722 df-cnp 22723 df-tx 23057 df-hmeo 23250 df-xms 23817 df-ms 23818 df-tms 23819

This theorem is referenced by: refsum2cn 43707

W3C validator