Theorem i1faddlem 24297

Description: Decompose the preimage of a sum. (Contributed by Mario Carneiro, 19-Jun-2014.)

Hypotheses

Ref	Expression
i1fadd.1	⊢ (𝜑 → 𝐹 ∈ dom ∫1)
i1fadd.2	⊢ (𝜑 → 𝐺 ∈ dom ∫1)

Assertion

Ref	Expression
i1faddlem	⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (◡(𝐹 ∘f + 𝐺) “ {𝐴}) = ∪ 𝑦 ∈ ran 𝐺((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})))

Distinct variable groups:   𝑦,𝐴   𝑦,𝐹   𝑦,𝐺   𝜑,𝑦

Proof of Theorem i1faddlem

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		i1fadd.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ dom ∫1)
2		i1ff 24280	. . . . . . . . 9 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℝ)
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
4	3	ffnd 6488	. . . . . . 7 ⊢ (𝜑 → 𝐹 Fn ℝ)
5		i1fadd.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ dom ∫1)
6		i1ff 24280	. . . . . . . . 9 ⊢ (𝐺 ∈ dom ∫1 → 𝐺:ℝ⟶ℝ)
7	5, 6	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐺:ℝ⟶ℝ)
8	7	ffnd 6488	. . . . . . 7 ⊢ (𝜑 → 𝐺 Fn ℝ)
9		reex 10617	. . . . . . . 8 ⊢ ℝ ∈ V
10	9	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ V)
11		inidm 4145	. . . . . . 7 ⊢ (ℝ ∩ ℝ) = ℝ
12	4, 8, 10, 10, 11	offn 7400	. . . . . 6 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) Fn ℝ)
13	12	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝐹 ∘f + 𝐺) Fn ℝ)
14		fniniseg 6807	. . . . 5 ⊢ ((𝐹 ∘f + 𝐺) Fn ℝ → (𝑧 ∈ (◡(𝐹 ∘f + 𝐺) “ {𝐴}) ↔ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
15	13, 14	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡(𝐹 ∘f + 𝐺) “ {𝐴}) ↔ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
16	8	ad2antrr 725	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐺 Fn ℝ)
17		simprl 770	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ ℝ)
18		fnfvelrn 6825	. . . . . . . 8 ⊢ ((𝐺 Fn ℝ ∧ 𝑧 ∈ ℝ) → (𝐺‘𝑧) ∈ ran 𝐺)
19	16, 17, 18	syl2anc 587	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐺‘𝑧) ∈ ran 𝐺)
20		simprr 772	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)
21		eqidd 2799	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝐹‘𝑧) = (𝐹‘𝑧))
22		eqidd 2799	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝐺‘𝑧) = (𝐺‘𝑧))
23	4, 8, 10, 10, 11, 21, 22	ofval 7398	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → ((𝐹 ∘f + 𝐺)‘𝑧) = ((𝐹‘𝑧) + (𝐺‘𝑧)))
24	23	ad2ant2r 746	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → ((𝐹 ∘f + 𝐺)‘𝑧) = ((𝐹‘𝑧) + (𝐺‘𝑧)))
25	20, 24	eqtr3d 2835	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐴 = ((𝐹‘𝑧) + (𝐺‘𝑧)))
26	25	oveq1d 7150	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐴 − (𝐺‘𝑧)) = (((𝐹‘𝑧) + (𝐺‘𝑧)) − (𝐺‘𝑧)))
27		ax-resscn 10583	. . . . . . . . . . . . . 14 ⊢ ℝ ⊆ ℂ
28		fss 6501	. . . . . . . . . . . . . 14 ⊢ ((𝐹:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐹:ℝ⟶ℂ)
29	3, 27, 28	sylancl 589	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐹:ℝ⟶ℂ)
30	29	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐹:ℝ⟶ℂ)
31	30, 17	ffvelrnd 6829	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐹‘𝑧) ∈ ℂ)
32		fss 6501	. . . . . . . . . . . . . 14 ⊢ ((𝐺:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐺:ℝ⟶ℂ)
33	7, 27, 32	sylancl 589	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺:ℝ⟶ℂ)
34	33	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐺:ℝ⟶ℂ)
35	34, 17	ffvelrnd 6829	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐺‘𝑧) ∈ ℂ)
36	31, 35	pncand 10987	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (((𝐹‘𝑧) + (𝐺‘𝑧)) − (𝐺‘𝑧)) = (𝐹‘𝑧))
37	26, 36	eqtr2d 2834	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐹‘𝑧) = (𝐴 − (𝐺‘𝑧)))
38	4	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐹 Fn ℝ)
39		fniniseg 6807	. . . . . . . . . 10 ⊢ (𝐹 Fn ℝ → (𝑧 ∈ (◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ↔ (𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − (𝐺‘𝑧)))))
40	38, 39	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝑧 ∈ (◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ↔ (𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − (𝐺‘𝑧)))))
41	17, 37, 40	mpbir2and 712	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ (◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}))
42		eqidd 2799	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐺‘𝑧) = (𝐺‘𝑧))
43		fniniseg 6807	. . . . . . . . . 10 ⊢ (𝐺 Fn ℝ → (𝑧 ∈ (◡𝐺 “ {(𝐺‘𝑧)}) ↔ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = (𝐺‘𝑧))))
44	16, 43	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝑧 ∈ (◡𝐺 “ {(𝐺‘𝑧)}) ↔ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = (𝐺‘𝑧))))
45	17, 42, 44	mpbir2and 712	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ (◡𝐺 “ {(𝐺‘𝑧)}))
46	41, 45	elind 4121	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ ((◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ∩ (◡𝐺 “ {(𝐺‘𝑧)})))
47		oveq2 7143	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐺‘𝑧) → (𝐴 − 𝑦) = (𝐴 − (𝐺‘𝑧)))
48	47	sneqd 4537	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐺‘𝑧) → {(𝐴 − 𝑦)} = {(𝐴 − (𝐺‘𝑧))})
49	48	imaeq2d 5896	. . . . . . . . . 10 ⊢ (𝑦 = (𝐺‘𝑧) → (◡𝐹 “ {(𝐴 − 𝑦)}) = (◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}))
50		sneq 4535	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐺‘𝑧) → {𝑦} = {(𝐺‘𝑧)})
51	50	imaeq2d 5896	. . . . . . . . . 10 ⊢ (𝑦 = (𝐺‘𝑧) → (◡𝐺 “ {𝑦}) = (◡𝐺 “ {(𝐺‘𝑧)}))
52	49, 51	ineq12d 4140	. . . . . . . . 9 ⊢ (𝑦 = (𝐺‘𝑧) → ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) = ((◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ∩ (◡𝐺 “ {(𝐺‘𝑧)})))
53	52	eleq2d 2875	. . . . . . . 8 ⊢ (𝑦 = (𝐺‘𝑧) → (𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) ↔ 𝑧 ∈ ((◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ∩ (◡𝐺 “ {(𝐺‘𝑧)}))))
54	53	rspcev 3571	. . . . . . 7 ⊢ (((𝐺‘𝑧) ∈ ran 𝐺 ∧ 𝑧 ∈ ((◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ∩ (◡𝐺 “ {(𝐺‘𝑧)}))) → ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})))
55	19, 46, 54	syl2anc 587	. . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})))
56	55	ex 416	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴) → ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦}))))
57		elin 3897	. . . . . . 7 ⊢ (𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) ↔ (𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ∧ 𝑧 ∈ (◡𝐺 “ {𝑦})))
58	4	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → 𝐹 Fn ℝ)
59		fniniseg 6807	. . . . . . . . . 10 ⊢ (𝐹 Fn ℝ → (𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ↔ (𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦))))
60	58, 59	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ↔ (𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦))))
61	8	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → 𝐺 Fn ℝ)
62		fniniseg 6807	. . . . . . . . . 10 ⊢ (𝐺 Fn ℝ → (𝑧 ∈ (◡𝐺 “ {𝑦}) ↔ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦)))
63	61, 62	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡𝐺 “ {𝑦}) ↔ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦)))
64	60, 63	anbi12d 633	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ∧ 𝑧 ∈ (◡𝐺 “ {𝑦})) ↔ ((𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦)) ∧ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦))))
65		anandi 675	. . . . . . . . 9 ⊢ ((𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦)) ↔ ((𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦)) ∧ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦)))
66		simprl 770	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → 𝑧 ∈ ℝ)
67	23	ad2ant2r 746	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → ((𝐹 ∘f + 𝐺)‘𝑧) = ((𝐹‘𝑧) + (𝐺‘𝑧)))
68		simprrl 780	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → (𝐹‘𝑧) = (𝐴 − 𝑦))
69		simprrr 781	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → (𝐺‘𝑧) = 𝑦)
70	68, 69	oveq12d 7153	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → ((𝐹‘𝑧) + (𝐺‘𝑧)) = ((𝐴 − 𝑦) + 𝑦))
71		simplr 768	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → 𝐴 ∈ ℂ)
72	33	ad2antrr 725	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → 𝐺:ℝ⟶ℂ)
73	72, 66	ffvelrnd 6829	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → (𝐺‘𝑧) ∈ ℂ)
74	69, 73	eqeltrrd 2891	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → 𝑦 ∈ ℂ)
75	71, 74	npcand 10990	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → ((𝐴 − 𝑦) + 𝑦) = 𝐴)
76	67, 70, 75	3eqtrd 2837	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)
77	66, 76	jca 515	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴))
78	77	ex 416	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦)) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
79	65, 78	syl5bir 246	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (((𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦)) ∧ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦)) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
80	64, 79	sylbid 243	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ∧ 𝑧 ∈ (◡𝐺 “ {𝑦})) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
81	57, 80	syl5bi 245	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
82	81	rexlimdvw 3249	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
83	56, 82	impbid 215	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴) ↔ ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦}))))
84	15, 83	bitrd 282	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡(𝐹 ∘f + 𝐺) “ {𝐴}) ↔ ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦}))))
85		eliun 4885	. . 3 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ ran 𝐺((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) ↔ ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})))
86	84, 85	syl6bbr 292	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡(𝐹 ∘f + 𝐺) “ {𝐴}) ↔ 𝑧 ∈ ∪ 𝑦 ∈ ran 𝐺((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦}))))
87	86	eqrdv 2796	1 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (◡(𝐹 ∘f + 𝐺) “ {𝐴}) = ∪ 𝑦 ∈ ran 𝐺((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∃wrex 3107  Vcvv 3441   ∩ cin 3880   ⊆ wss 3881  {csn 4525  ∪ ciun 4881  ^◡ccnv 5518  dom cdm 5519  ran crn 5520   “ cima 5522   Fn wfn 6319  ⟶wf 6320  ‘cfv 6324  (class class class)co 7135   ∘_f cof 7387  ℂcc 10524  ℝcr 10525   + caddc 10529   − cmin 10859  ∫₁citg1 24219

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-po 5438  df-so 5439  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-of 7389  df-er 8272  df-en 8493  df-dom 8494  df-sdom 8495  df-pnf 10666  df-mnf 10667  df-ltxr 10669  df-sub 10861  df-sum 15035  df-itg1 24224

This theorem is referenced by:  i1fadd  24299  itg1addlem4  24303