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 44210

Description: This is the core Lemma for refsum2cn 44211: 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 5246	. . . . . . . . 9 ⊢ Ⅎ𝑘(𝑘 ∈ {1, 2} ↦ if(𝑘 = 1, 𝐹, 𝐺))
4	2, 3	nfcxfr 2893	. . . . . . . 8 ⊢ Ⅎ𝑘𝐴
5		nfcv 2895	. . . . . . . 8 ⊢ Ⅎ𝑘1
6	4, 5	nffv 6891	. . . . . . 7 ⊢ Ⅎ𝑘(𝐴‘1)
7		nfcv 2895	. . . . . . 7 ⊢ Ⅎ𝑘𝑥
8	6, 7	nffv 6891	. . . . . 6 ⊢ Ⅎ𝑘((𝐴‘1)‘𝑥)
9	8	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Ⅎ𝑘((𝐴‘1)‘𝑥))
10		nfcv 2895	. . . . . . . 8 ⊢ Ⅎ𝑘2
11	4, 10	nffv 6891	. . . . . . 7 ⊢ Ⅎ𝑘(𝐴‘2)
12	11, 7	nffv 6891	. . . . . 6 ⊢ Ⅎ𝑘((𝐴‘2)‘𝑥)
13	12	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Ⅎ𝑘((𝐴‘2)‘𝑥))
14		1cnd 11206	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 1 ∈ ℂ)
15		2cnd 12287	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 2 ∈ ℂ)
16		1ex 11207	. . . . . . . . . . 11 ⊢ 1 ∈ V
17	16	prid1 4758	. . . . . . . . . 10 ⊢ 1 ∈ {1, 2}
18		refsum2cnlem1.8	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
19		refsum2cnlem1.9	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾))
20	18, 19	ifcld 4566	. . . . . . . . . 10 ⊢ (𝜑 → if(1 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾))
21		eqeq1 2728	. . . . . . . . . . . 12 ⊢ (𝑘 = 1 → (𝑘 = 1 ↔ 1 = 1))
22	21	ifbid 4543	. . . . . . . . . . 11 ⊢ (𝑘 = 1 → if(𝑘 = 1, 𝐹, 𝐺) = if(1 = 1, 𝐹, 𝐺))
23	22, 2	fvmptg 6986	. . . . . . . . . 10 ⊢ ((1 ∈ {1, 2} ∧ if(1 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾)) → (𝐴‘1) = if(1 = 1, 𝐹, 𝐺))
24	17, 20, 23	sylancr 586	. . . . . . . . 9 ⊢ (𝜑 → (𝐴‘1) = if(1 = 1, 𝐹, 𝐺))
25		eqid 2724	. . . . . . . . . 10 ⊢ 1 = 1
26	25	iftruei 4527	. . . . . . . . 9 ⊢ if(1 = 1, 𝐹, 𝐺) = 𝐹
27	24, 26	eqtrdi 2780	. . . . . . . 8 ⊢ (𝜑 → (𝐴‘1) = 𝐹)
28	27	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐴‘1) = 𝐹)
29	28	fveq1d 6883	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐴‘1)‘𝑥) = (𝐹‘𝑥))
30		eqid 2724	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
31		eqid 2724	. . . . . . . . . . 11 ⊢ ∪ 𝐾 = ∪ 𝐾
32	30, 31	cnf 23072	. . . . . . . . . 10 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾)
33	18, 32	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:∪ 𝐽⟶∪ 𝐾)
34		refsum2cnlem1.7	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
35		toponuni 22738	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
36	34, 35	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 = ∪ 𝐽)
37	36	eqcomd 2730	. . . . . . . . . 10 ⊢ (𝜑 → ∪ 𝐽 = 𝑋)
38		refsum2cnlem1.6	. . . . . . . . . . . . 13 ⊢ 𝐾 = (topGen‘ran (,))
39	38	unieqi 4911	. . . . . . . . . . . 12 ⊢ ∪ 𝐾 = ∪ (topGen‘ran (,))
40		uniretop 24601	. . . . . . . . . . . 12 ⊢ ℝ = ∪ (topGen‘ran (,))
41	39, 40	eqtr4i 2755	. . . . . . . . . . 11 ⊢ ∪ 𝐾 = ℝ
42	41	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → ∪ 𝐾 = ℝ)
43	37, 42	feq23d 6702	. . . . . . . . 9 ⊢ (𝜑 → (𝐹:∪ 𝐽⟶∪ 𝐾 ↔ 𝐹:𝑋⟶ℝ))
44	33, 43	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ)
45	44	anim1i 614	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹:𝑋⟶ℝ ∧ 𝑥 ∈ 𝑋))
46		ffvelcdm 7073	. . . . . . 7 ⊢ ((𝐹:𝑋⟶ℝ ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℝ)
47		recn 11196	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ ℝ → (𝐹‘𝑥) ∈ ℂ)
48	45, 46, 47	3syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ ℂ)
49	29, 48	eqeltrd 2825	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐴‘1)‘𝑥) ∈ ℂ)
50		2ex 12286	. . . . . . . . . . 11 ⊢ 2 ∈ V
51	50	prid2 4759	. . . . . . . . . 10 ⊢ 2 ∈ {1, 2}
52	18, 19	ifcld 4566	. . . . . . . . . 10 ⊢ (𝜑 → if(2 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾))
53		eqeq1 2728	. . . . . . . . . . . 12 ⊢ (𝑘 = 2 → (𝑘 = 1 ↔ 2 = 1))
54	53	ifbid 4543	. . . . . . . . . . 11 ⊢ (𝑘 = 2 → if(𝑘 = 1, 𝐹, 𝐺) = if(2 = 1, 𝐹, 𝐺))
55	54, 2	fvmptg 6986	. . . . . . . . . 10 ⊢ ((2 ∈ {1, 2} ∧ if(2 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾)) → (𝐴‘2) = if(2 = 1, 𝐹, 𝐺))
56	51, 52, 55	sylancr 586	. . . . . . . . 9 ⊢ (𝜑 → (𝐴‘2) = if(2 = 1, 𝐹, 𝐺))
57		1ne2 12417	. . . . . . . . . . 11 ⊢ 1 ≠ 2
58	57	nesymi 2990	. . . . . . . . . 10 ⊢ ¬ 2 = 1
59	58	iffalsei 4530	. . . . . . . . 9 ⊢ if(2 = 1, 𝐹, 𝐺) = 𝐺
60	56, 59	eqtrdi 2780	. . . . . . . 8 ⊢ (𝜑 → (𝐴‘2) = 𝐺)
61	60	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐴‘2) = 𝐺)
62	61	fveq1d 6883	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐴‘2)‘𝑥) = (𝐺‘𝑥))
63	30, 31	cnf 23072	. . . . . . . . . 10 ⊢ (𝐺 ∈ (𝐽 Cn 𝐾) → 𝐺:∪ 𝐽⟶∪ 𝐾)
64	19, 63	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:∪ 𝐽⟶∪ 𝐾)
65	37, 42	feq23d 6702	. . . . . . . . 9 ⊢ (𝜑 → (𝐺:∪ 𝐽⟶∪ 𝐾 ↔ 𝐺:𝑋⟶ℝ))
66	64, 65	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → 𝐺:𝑋⟶ℝ)
67	66	anim1i 614	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺:𝑋⟶ℝ ∧ 𝑥 ∈ 𝑋))
68		ffvelcdm 7073	. . . . . . 7 ⊢ ((𝐺:𝑋⟶ℝ ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) ∈ ℝ)
69		recn 11196	. . . . . . 7 ⊢ ((𝐺‘𝑥) ∈ ℝ → (𝐺‘𝑥) ∈ ℂ)
70	67, 68, 69	3syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) ∈ ℂ)
71	62, 70	eqeltrd 2825	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐴‘2)‘𝑥) ∈ ℂ)
72	57	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 1 ≠ 2)
73		fveq2 6881	. . . . . . 7 ⊢ (𝑘 = 1 → (𝐴‘𝑘) = (𝐴‘1))
74	73	fveq1d 6883	. . . . . 6 ⊢ (𝑘 = 1 → ((𝐴‘𝑘)‘𝑥) = ((𝐴‘1)‘𝑥))
75	74	adantl 481	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑘 = 1) → ((𝐴‘𝑘)‘𝑥) = ((𝐴‘1)‘𝑥))
76		fveq2 6881	. . . . . . 7 ⊢ (𝑘 = 2 → (𝐴‘𝑘) = (𝐴‘2))
77	76	fveq1d 6883	. . . . . 6 ⊢ (𝑘 = 2 → ((𝐴‘𝑘)‘𝑥) = ((𝐴‘2)‘𝑥))
78	77	adantl 481	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑘 = 2) → ((𝐴‘𝑘)‘𝑥) = ((𝐴‘2)‘𝑥))
79	9, 13, 14, 15, 49, 71, 72, 75, 78	sumpair 44208	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Σ𝑘 ∈ {1, 2} ((𝐴‘𝑘)‘𝑥) = (((𝐴‘1)‘𝑥) + ((𝐴‘2)‘𝑥)))
80	29, 62	oveq12d 7419	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (((𝐴‘1)‘𝑥) + ((𝐴‘2)‘𝑥)) = ((𝐹‘𝑥) + (𝐺‘𝑥)))
81	79, 80	eqtrd 2764	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Σ𝑘 ∈ {1, 2} ((𝐴‘𝑘)‘𝑥) = ((𝐹‘𝑥) + (𝐺‘𝑥)))
82	1, 81	mpteq2da 5236	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ Σ𝑘 ∈ {1, 2} ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ ((𝐹‘𝑥) + (𝐺‘𝑥))))
83		prfi 9318	. . . 4 ⊢ {1, 2} ∈ Fin
84	83	a1i 11	. . 3 ⊢ (𝜑 → {1, 2} ∈ Fin)
85		eqid 2724	. . . . . . . . . 10 ⊢ 𝑋 = 𝑋
86	85	ax-gen 1789	. . . . . . . . 9 ⊢ ∀𝑥 𝑋 = 𝑋
87		refsum2cnlem1.1	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝐴
88		nfcv 2895	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑘
89	87, 88	nffv 6891	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝐴‘𝑘)
90		refsum2cnlem1.2	. . . . . . . . . . 11 ⊢ Ⅎ𝑥𝐹
91	89, 90	nfeq 2908	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝐴‘𝑘) = 𝐹
92		fveq1 6880	. . . . . . . . . . 11 ⊢ ((𝐴‘𝑘) = 𝐹 → ((𝐴‘𝑘)‘𝑥) = (𝐹‘𝑥))
93	92	a1d 25	. . . . . . . . . 10 ⊢ ((𝐴‘𝑘) = 𝐹 → (𝑥 ∈ 𝑋 → ((𝐴‘𝑘)‘𝑥) = (𝐹‘𝑥)))
94	91, 93	ralrimi 3246	. . . . . . . . 9 ⊢ ((𝐴‘𝑘) = 𝐹 → ∀𝑥 ∈ 𝑋 ((𝐴‘𝑘)‘𝑥) = (𝐹‘𝑥))
95		mpteq12f 5226	. . . . . . . . 9 ⊢ ((∀𝑥 𝑋 = 𝑋 ∧ ∀𝑥 ∈ 𝑋 ((𝐴‘𝑘)‘𝑥) = (𝐹‘𝑥)) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
96	86, 94, 95	sylancr 586	. . . . . . . 8 ⊢ ((𝐴‘𝑘) = 𝐹 → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
97	96	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
98		retopon 24602	. . . . . . . . . . . . 13 ⊢ (topGen‘ran (,)) ∈ (TopOn‘ℝ)
99	38, 98	eqeltri 2821	. . . . . . . . . . . 12 ⊢ 𝐾 ∈ (TopOn‘ℝ)
100	99	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘ℝ))
101		cnf2 23075	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘ℝ) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:𝑋⟶ℝ)
102	34, 100, 18, 101	syl3anc 1368	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝑋⟶ℝ)
103	102	ffnd 6708	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 Fn 𝑋)
104	90	dffn5f 6953	. . . . . . . . 9 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹 = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
105	103, 104	sylib 217	. . . . . . . 8 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
106	105	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → 𝐹 = (𝑥 ∈ 𝑋 ↦ (𝐹‘𝑥)))
107	97, 106	eqtr4d 2767	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = 𝐹)
108	18	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → 𝐹 ∈ (𝐽 Cn 𝐾))
109	107, 108	eqeltrd 2825	. . . . 5 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐹) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
110	109	adantlr 712	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ (𝐴‘𝑘) = 𝐹) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
111		refsum2cnlem1.3	. . . . . . . . . . 11 ⊢ Ⅎ𝑥𝐺
112	89, 111	nfeq 2908	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝐴‘𝑘) = 𝐺
113		fveq1 6880	. . . . . . . . . . 11 ⊢ ((𝐴‘𝑘) = 𝐺 → ((𝐴‘𝑘)‘𝑥) = (𝐺‘𝑥))
114	113	a1d 25	. . . . . . . . . 10 ⊢ ((𝐴‘𝑘) = 𝐺 → (𝑥 ∈ 𝑋 → ((𝐴‘𝑘)‘𝑥) = (𝐺‘𝑥)))
115	112, 114	ralrimi 3246	. . . . . . . . 9 ⊢ ((𝐴‘𝑘) = 𝐺 → ∀𝑥 ∈ 𝑋 ((𝐴‘𝑘)‘𝑥) = (𝐺‘𝑥))
116		mpteq12f 5226	. . . . . . . . 9 ⊢ ((∀𝑥 𝑋 = 𝑋 ∧ ∀𝑥 ∈ 𝑋 ((𝐴‘𝑘)‘𝑥) = (𝐺‘𝑥)) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
117	86, 115, 116	sylancr 586	. . . . . . . 8 ⊢ ((𝐴‘𝑘) = 𝐺 → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
118	117	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
119		cnf2 23075	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘ℝ) ∧ 𝐺 ∈ (𝐽 Cn 𝐾)) → 𝐺:𝑋⟶ℝ)
120	34, 100, 19, 119	syl3anc 1368	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺:𝑋⟶ℝ)
121	120	ffnd 6708	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 Fn 𝑋)
122	111	dffn5f 6953	. . . . . . . . 9 ⊢ (𝐺 Fn 𝑋 ↔ 𝐺 = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
123	121, 122	sylib 217	. . . . . . . 8 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
124	123	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → 𝐺 = (𝑥 ∈ 𝑋 ↦ (𝐺‘𝑥)))
125	118, 124	eqtr4d 2767	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) = 𝐺)
126	19	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → 𝐺 ∈ (𝐽 Cn 𝐾))
127	125, 126	eqeltrd 2825	. . . . 5 ⊢ ((𝜑 ∧ (𝐴‘𝑘) = 𝐺) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
128	127	adantlr 712	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ (𝐴‘𝑘) = 𝐺) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
129		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → 𝑘 ∈ {1, 2})
130	18, 19	ifcld 4566	. . . . . . . . 9 ⊢ (𝜑 → if(𝑘 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾))
131	130	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → if(𝑘 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾))
132	2	fvmpt2 6999	. . . . . . . 8 ⊢ ((𝑘 ∈ {1, 2} ∧ if(𝑘 = 1, 𝐹, 𝐺) ∈ (𝐽 Cn 𝐾)) → (𝐴‘𝑘) = if(𝑘 = 1, 𝐹, 𝐺))
133	129, 131, 132	syl2anc 583	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → (𝐴‘𝑘) = if(𝑘 = 1, 𝐹, 𝐺))
134		iftrue 4526	. . . . . . 7 ⊢ (𝑘 = 1 → if(𝑘 = 1, 𝐹, 𝐺) = 𝐹)
135	133, 134	sylan9eq 2784	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 1) → (𝐴‘𝑘) = 𝐹)
136	135	orcd 870	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 1) → ((𝐴‘𝑘) = 𝐹 ∨ (𝐴‘𝑘) = 𝐺))
137	133	adantr 480	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → (𝐴‘𝑘) = if(𝑘 = 1, 𝐹, 𝐺))
138		neeq2 2996	. . . . . . . . . . . 12 ⊢ (𝑘 = 2 → (1 ≠ 𝑘 ↔ 1 ≠ 2))
139	57, 138	mpbiri 258	. . . . . . . . . . 11 ⊢ (𝑘 = 2 → 1 ≠ 𝑘)
140	139	necomd 2988	. . . . . . . . . 10 ⊢ (𝑘 = 2 → 𝑘 ≠ 1)
141	140	neneqd 2937	. . . . . . . . 9 ⊢ (𝑘 = 2 → ¬ 𝑘 = 1)
142	141	adantl 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → ¬ 𝑘 = 1)
143	142	iffalsed 4531	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → if(𝑘 = 1, 𝐹, 𝐺) = 𝐺)
144	137, 143	eqtrd 2764	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → (𝐴‘𝑘) = 𝐺)
145	144	olcd 871	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ {1, 2}) ∧ 𝑘 = 2) → ((𝐴‘𝑘) = 𝐹 ∨ (𝐴‘𝑘) = 𝐺))
146		elpri 4642	. . . . . 6 ⊢ (𝑘 ∈ {1, 2} → (𝑘 = 1 ∨ 𝑘 = 2))
147	146	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → (𝑘 = 1 ∨ 𝑘 = 2))
148	136, 145, 147	mpjaodan 955	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → ((𝐴‘𝑘) = 𝐹 ∨ (𝐴‘𝑘) = 𝐺))
149	110, 128, 148	mpjaodan 955	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {1, 2}) → (𝑥 ∈ 𝑋 ↦ ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
150	1, 38, 34, 84, 149	refsumcn 44203	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ Σ𝑘 ∈ {1, 2} ((𝐴‘𝑘)‘𝑥)) ∈ (𝐽 Cn 𝐾))
151	82, 150	eqeltrrd 2826	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ ((𝐹‘𝑥) + (𝐺‘𝑥))) ∈ (𝐽 Cn 𝐾))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 844 ∀wal 1531 = wceq 1533 Ⅎwnf 1777 ∈ wcel 2098 Ⅎwnfc 2875 ≠ wne 2932 ∀wral 3053 ifcif 4520 {cpr 4622 ∪ cuni 4899 ↦ cmpt 5221 ran crn 5667 Fn wfn 6528 ⟶wf 6529 ‘cfv 6533 (class class class)co 7401 Fincfn 8935 ℂcc 11104 ℝcr 11105 1c1 11107 + caddc 11109 2c2 12264 (,)cioo 13321 Σcsu 15629 topGenctg 17382 TopOnctopon 22734 Cn ccn 23050

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5275 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 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 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-tp 4625 df-op 4627 df-uni 4900 df-int 4941 df-iun 4989 df-iin 4990 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-se 5622 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 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 7357 df-ov 7404 df-oprab 7405 df-mpo 7406 df-of 7663 df-om 7849 df-1st 7968 df-2nd 7969 df-supp 8141 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-1o 8461 df-2o 8462 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 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 df-nn 12210 df-2 12272 df-3 12273 df-4 12274 df-5 12275 df-6 12276 df-7 12277 df-8 12278 df-9 12279 df-n0 12470 df-z 12556 df-dec 12675 df-uz 12820 df-q 12930 df-rp 12972 df-xneg 13089 df-xadd 13090 df-xmul 13091 df-ioo 13325 df-icc 13328 df-fz 13482 df-fzo 13625 df-seq 13964 df-exp 14025 df-hash 14288 df-cj 15043 df-re 15044 df-im 15045 df-sqrt 15179 df-abs 15180 df-clim 15429 df-sum 15630 df-struct 17079 df-sets 17096 df-slot 17114 df-ndx 17126 df-base 17144 df-ress 17173 df-plusg 17209 df-mulr 17210 df-starv 17211 df-sca 17212 df-vsca 17213 df-ip 17214 df-tset 17215 df-ple 17216 df-ds 17218 df-unif 17219 df-hom 17220 df-cco 17221 df-rest 17367 df-topn 17368 df-0g 17386 df-gsum 17387 df-topgen 17388 df-pt 17389 df-prds 17392 df-xrs 17447 df-qtop 17452 df-imas 17453 df-xps 17455 df-mre 17529 df-mrc 17530 df-acs 17532 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-submnd 18704 df-mulg 18986 df-cntz 19223 df-cmn 19692 df-psmet 21220 df-xmet 21221 df-met 21222 df-bl 21223 df-mopn 21224 df-cnfld 21229 df-top 22718 df-topon 22735 df-topsp 22757 df-bases 22771 df-cn 23053 df-cnp 23054 df-tx 23388 df-hmeo 23581 df-xms 24148 df-ms 24149 df-tms 24150

This theorem is referenced by: refsum2cn 44211

W3C validator