Theorem i1faddlem 25743

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 25726	. . . . . . . . 9 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℝ)
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
4	3	ffnd 6687	. . . . . . 7 ⊢ (𝜑 → 𝐹 Fn ℝ)
5		i1fadd.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ dom ∫1)
6		i1ff 25726	. . . . . . . . 9 ⊢ (𝐺 ∈ dom ∫1 → 𝐺:ℝ⟶ℝ)
7	5, 6	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐺:ℝ⟶ℝ)
8	7	ffnd 6687	. . . . . . 7 ⊢ (𝜑 → 𝐺 Fn ℝ)
9		reex 11158	. . . . . . . 8 ⊢ ℝ ∈ V
10	9	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ V)
11		inidm 4176	. . . . . . 7 ⊢ (ℝ ∩ ℝ) = ℝ
12	4, 8, 10, 10, 11	offn 7668	. . . . . 6 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) Fn ℝ)
13	12	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝐹 ∘f + 𝐺) Fn ℝ)
14		fniniseg 7036	. . . . 5 ⊢ ((𝐹 ∘f + 𝐺) Fn ℝ → (𝑧 ∈ (◡(𝐹 ∘f + 𝐺) “ {𝐴}) ↔ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
15	13, 14	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡(𝐹 ∘f + 𝐺) “ {𝐴}) ↔ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
16	8	ad2antrr 736	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐺 Fn ℝ)
17		simprl 780	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ ℝ)
18		fnfvelrn 7056	. . . . . . . 8 ⊢ ((𝐺 Fn ℝ ∧ 𝑧 ∈ ℝ) → (𝐺‘𝑧) ∈ ran 𝐺)
19	16, 17, 18	syl2anc 593	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐺‘𝑧) ∈ ran 𝐺)
20		simprr 782	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)
21		eqidd 2762	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝐹‘𝑧) = (𝐹‘𝑧))
22		eqidd 2762	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝐺‘𝑧) = (𝐺‘𝑧))
23	4, 8, 10, 10, 11, 21, 22	ofval 7666	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → ((𝐹 ∘f + 𝐺)‘𝑧) = ((𝐹‘𝑧) + (𝐺‘𝑧)))
24	23	ad2ant2r 757	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → ((𝐹 ∘f + 𝐺)‘𝑧) = ((𝐹‘𝑧) + (𝐺‘𝑧)))
25	20, 24	eqtr3d 2798	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐴 = ((𝐹‘𝑧) + (𝐺‘𝑧)))
26	25	oveq1d 7406	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐴 − (𝐺‘𝑧)) = (((𝐹‘𝑧) + (𝐺‘𝑧)) − (𝐺‘𝑧)))
27		ax-resscn 11124	. . . . . . . . . . . . . 14 ⊢ ℝ ⊆ ℂ
28		fss 6703	. . . . . . . . . . . . . 14 ⊢ ((𝐹:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐹:ℝ⟶ℂ)
29	3, 27, 28	sylancl 595	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐹:ℝ⟶ℂ)
30	29	ad2antrr 736	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐹:ℝ⟶ℂ)
31	30, 17	ffvelcdmd 7061	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐹‘𝑧) ∈ ℂ)
32		fss 6703	. . . . . . . . . . . . . 14 ⊢ ((𝐺:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐺:ℝ⟶ℂ)
33	7, 27, 32	sylancl 595	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺:ℝ⟶ℂ)
34	33	ad2antrr 736	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐺:ℝ⟶ℂ)
35	34, 17	ffvelcdmd 7061	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐺‘𝑧) ∈ ℂ)
36	31, 35	pncand 11537	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (((𝐹‘𝑧) + (𝐺‘𝑧)) − (𝐺‘𝑧)) = (𝐹‘𝑧))
37	26, 36	eqtr2d 2797	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐹‘𝑧) = (𝐴 − (𝐺‘𝑧)))
38	4	ad2antrr 736	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝐹 Fn ℝ)
39		fniniseg 7036	. . . . . . . . . 10 ⊢ (𝐹 Fn ℝ → (𝑧 ∈ (◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ↔ (𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − (𝐺‘𝑧)))))
40	38, 39	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝑧 ∈ (◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ↔ (𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − (𝐺‘𝑧)))))
41	17, 37, 40	mpbir2and 723	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ (◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}))
42		eqidd 2762	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝐺‘𝑧) = (𝐺‘𝑧))
43		fniniseg 7036	. . . . . . . . . 10 ⊢ (𝐺 Fn ℝ → (𝑧 ∈ (◡𝐺 “ {(𝐺‘𝑧)}) ↔ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = (𝐺‘𝑧))))
44	16, 43	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → (𝑧 ∈ (◡𝐺 “ {(𝐺‘𝑧)}) ↔ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = (𝐺‘𝑧))))
45	17, 42, 44	mpbir2and 723	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ (◡𝐺 “ {(𝐺‘𝑧)}))
46	41, 45	elind 4150	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ ((◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ∩ (◡𝐺 “ {(𝐺‘𝑧)})))
47		oveq2 7399	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐺‘𝑧) → (𝐴 − 𝑦) = (𝐴 − (𝐺‘𝑧)))
48	47	sneqd 4591	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐺‘𝑧) → {(𝐴 − 𝑦)} = {(𝐴 − (𝐺‘𝑧))})
49	48	imaeq2d 6045	. . . . . . . . . 10 ⊢ (𝑦 = (𝐺‘𝑧) → (◡𝐹 “ {(𝐴 − 𝑦)}) = (◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}))
50		sneq 4589	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐺‘𝑧) → {𝑦} = {(𝐺‘𝑧)})
51	50	imaeq2d 6045	. . . . . . . . . 10 ⊢ (𝑦 = (𝐺‘𝑧) → (◡𝐺 “ {𝑦}) = (◡𝐺 “ {(𝐺‘𝑧)}))
52	49, 51	ineq12d 4171	. . . . . . . . 9 ⊢ (𝑦 = (𝐺‘𝑧) → ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) = ((◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ∩ (◡𝐺 “ {(𝐺‘𝑧)})))
53	52	eleq2d 2847	. . . . . . . 8 ⊢ (𝑦 = (𝐺‘𝑧) → (𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) ↔ 𝑧 ∈ ((◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ∩ (◡𝐺 “ {(𝐺‘𝑧)}))))
54	53	rspcev 3580	. . . . . . 7 ⊢ (((𝐺‘𝑧) ∈ ran 𝐺 ∧ 𝑧 ∈ ((◡𝐹 “ {(𝐴 − (𝐺‘𝑧))}) ∩ (◡𝐺 “ {(𝐺‘𝑧)}))) → ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})))
55	19, 46, 54	syl2anc 593	. . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)) → ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})))
56	55	ex 416	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴) → ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦}))))
57		elin 3918	. . . . . . 7 ⊢ (𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) ↔ (𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ∧ 𝑧 ∈ (◡𝐺 “ {𝑦})))
58	4	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → 𝐹 Fn ℝ)
59		fniniseg 7036	. . . . . . . . . 10 ⊢ (𝐹 Fn ℝ → (𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ↔ (𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦))))
60	58, 59	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ↔ (𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦))))
61	8	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → 𝐺 Fn ℝ)
62		fniniseg 7036	. . . . . . . . . 10 ⊢ (𝐺 Fn ℝ → (𝑧 ∈ (◡𝐺 “ {𝑦}) ↔ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦)))
63	61, 62	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡𝐺 “ {𝑦}) ↔ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦)))
64	60, 63	anbi12d 641	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ∧ 𝑧 ∈ (◡𝐺 “ {𝑦})) ↔ ((𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦)) ∧ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦))))
65		anandi 686	. . . . . . . . 9 ⊢ ((𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦)) ↔ ((𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦)) ∧ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦)))
66		simprl 780	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → 𝑧 ∈ ℝ)
67	23	ad2ant2r 757	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → ((𝐹 ∘f + 𝐺)‘𝑧) = ((𝐹‘𝑧) + (𝐺‘𝑧)))
68		simprrl 790	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → (𝐹‘𝑧) = (𝐴 − 𝑦))
69		simprrr 791	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → (𝐺‘𝑧) = 𝑦)
70	68, 69	oveq12d 7409	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → ((𝐹‘𝑧) + (𝐺‘𝑧)) = ((𝐴 − 𝑦) + 𝑦))
71		simplr 778	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → 𝐴 ∈ ℂ)
72	33	ad2antrr 736	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → 𝐺:ℝ⟶ℂ)
73	72, 66	ffvelcdmd 7061	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → (𝐺‘𝑧) ∈ ℂ)
74	69, 73	eqeltrrd 2862	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → 𝑦 ∈ ℂ)
75	71, 74	npcand 11540	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → ((𝐴 − 𝑦) + 𝑦) = 𝐴)
76	67, 70, 75	3eqtrd 2800	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)
77	66, 76	jca 519	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦))) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴))
78	77	ex 416	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ ℝ ∧ ((𝐹‘𝑧) = (𝐴 − 𝑦) ∧ (𝐺‘𝑧) = 𝑦)) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
79	65, 78	biimtrrid 245	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (((𝑧 ∈ ℝ ∧ (𝐹‘𝑧) = (𝐴 − 𝑦)) ∧ (𝑧 ∈ ℝ ∧ (𝐺‘𝑧) = 𝑦)) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
80	64, 79	sylbid 242	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ (◡𝐹 “ {(𝐴 − 𝑦)}) ∧ 𝑧 ∈ (◡𝐺 “ {𝑦})) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
81	57, 80	biimtrid 244	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
82	81	rexlimdvw 3167	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) → (𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴)))
83	56, 82	impbid 214	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → ((𝑧 ∈ ℝ ∧ ((𝐹 ∘f + 𝐺)‘𝑧) = 𝐴) ↔ ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦}))))
84	15, 83	bitrd 281	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡(𝐹 ∘f + 𝐺) “ {𝐴}) ↔ ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦}))))
85		eliun 4950	. . 3 ⊢ (𝑧 ∈ ∪ 𝑦 ∈ ran 𝐺((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})) ↔ ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})))
86	84, 85	bitr4di 291	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (𝑧 ∈ (◡(𝐹 ∘f + 𝐺) “ {𝐴}) ↔ 𝑧 ∈ ∪ 𝑦 ∈ ran 𝐺((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦}))))
87	86	eqrdv 2759	1 ⊢ ((𝜑 ∧ 𝐴 ∈ ℂ) → (◡(𝐹 ∘f + 𝐺) “ {𝐴}) = ∪ 𝑦 ∈ ran 𝐺((◡𝐹 “ {(𝐴 − 𝑦)}) ∩ (◡𝐺 “ {𝑦})))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1559   ∈ wcel 2141  ∃wrex 3085  Vcvv 3453   ∩ cin 3901   ⊆ wss 3902  {csn 4579  ∪ ciun 4946  ^◡ccnv 5642  dom cdm 5643  ran crn 5644   “ cima 5646   Fn wfn 6511  ⟶wf 6512  ‘cfv 6516  (class class class)co 7391   ∘_f cof 7653  ℂcc 11065  ℝcr 11066   + caddc 11070   − cmin 11408  ∫₁citg1 25665

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713  ax-cnex 11123  ax-resscn 11124  ax-1cn 11125  ax-icn 11126  ax-addcl 11127  ax-addrcl 11128  ax-mulcl 11129  ax-mulrcl 11130  ax-mulcom 11131  ax-addass 11132  ax-mulass 11133  ax-distr 11134  ax-i2m1 11135  ax-1ne0 11136  ax-1rid 11137  ax-rnegex 11138  ax-rrecex 11139  ax-cnre 11140  ax-pre-lttri 11141  ax-pre-lttrn 11142  ax-pre-ltadd 11143

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-po 5551  df-so 5552  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-riota 7348  df-ov 7394  df-oprab 7395  df-mpo 7396  df-of 7655  df-er 8672  df-en 8922  df-dom 8923  df-sdom 8924  df-pnf 11212  df-mnf 11213  df-ltxr 11215  df-sub 11410  df-sum 15705  df-itg1 25670

This theorem is referenced by:  i1fadd  25745  itg1addlem4  25749