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

Theorem i1faddlem 23659
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 ((𝜑𝐴 ∈ ℂ) → ((𝐹𝑓 + 𝐺) “ {𝐴}) = 𝑦 ∈ ran 𝐺((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})))
Distinct variable groups:   𝑦,𝐴   𝑦,𝐹   𝑦,𝐺   𝜑,𝑦

Proof of Theorem i1faddlem
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 i1fadd.1 . . . . . . . . 9 (𝜑𝐹 ∈ dom ∫1)
2 i1ff 23642 . . . . . . . . 9 (𝐹 ∈ dom ∫1𝐹:ℝ⟶ℝ)
31, 2syl 17 . . . . . . . 8 (𝜑𝐹:ℝ⟶ℝ)
4 ffn 6206 . . . . . . . 8 (𝐹:ℝ⟶ℝ → 𝐹 Fn ℝ)
53, 4syl 17 . . . . . . 7 (𝜑𝐹 Fn ℝ)
6 i1fadd.2 . . . . . . . . 9 (𝜑𝐺 ∈ dom ∫1)
7 i1ff 23642 . . . . . . . . 9 (𝐺 ∈ dom ∫1𝐺:ℝ⟶ℝ)
86, 7syl 17 . . . . . . . 8 (𝜑𝐺:ℝ⟶ℝ)
9 ffn 6206 . . . . . . . 8 (𝐺:ℝ⟶ℝ → 𝐺 Fn ℝ)
108, 9syl 17 . . . . . . 7 (𝜑𝐺 Fn ℝ)
11 reex 10219 . . . . . . . 8 ℝ ∈ V
1211a1i 11 . . . . . . 7 (𝜑 → ℝ ∈ V)
13 inidm 3965 . . . . . . 7 (ℝ ∩ ℝ) = ℝ
145, 10, 12, 12, 13offn 7073 . . . . . 6 (𝜑 → (𝐹𝑓 + 𝐺) Fn ℝ)
1514adantr 472 . . . . 5 ((𝜑𝐴 ∈ ℂ) → (𝐹𝑓 + 𝐺) Fn ℝ)
16 fniniseg 6501 . . . . 5 ((𝐹𝑓 + 𝐺) Fn ℝ → (𝑧 ∈ ((𝐹𝑓 + 𝐺) “ {𝐴}) ↔ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)))
1715, 16syl 17 . . . 4 ((𝜑𝐴 ∈ ℂ) → (𝑧 ∈ ((𝐹𝑓 + 𝐺) “ {𝐴}) ↔ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)))
1810ad2antrr 764 . . . . . . . 8 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → 𝐺 Fn ℝ)
19 simprl 811 . . . . . . . 8 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ ℝ)
20 fnfvelrn 6519 . . . . . . . 8 ((𝐺 Fn ℝ ∧ 𝑧 ∈ ℝ) → (𝐺𝑧) ∈ ran 𝐺)
2118, 19, 20syl2anc 696 . . . . . . 7 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → (𝐺𝑧) ∈ ran 𝐺)
22 simprr 813 . . . . . . . . . . . 12 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)
23 eqidd 2761 . . . . . . . . . . . . . 14 ((𝜑𝑧 ∈ ℝ) → (𝐹𝑧) = (𝐹𝑧))
24 eqidd 2761 . . . . . . . . . . . . . 14 ((𝜑𝑧 ∈ ℝ) → (𝐺𝑧) = (𝐺𝑧))
255, 10, 12, 12, 13, 23, 24ofval 7071 . . . . . . . . . . . . 13 ((𝜑𝑧 ∈ ℝ) → ((𝐹𝑓 + 𝐺)‘𝑧) = ((𝐹𝑧) + (𝐺𝑧)))
2625ad2ant2r 800 . . . . . . . . . . . 12 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → ((𝐹𝑓 + 𝐺)‘𝑧) = ((𝐹𝑧) + (𝐺𝑧)))
2722, 26eqtr3d 2796 . . . . . . . . . . 11 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → 𝐴 = ((𝐹𝑧) + (𝐺𝑧)))
2827oveq1d 6828 . . . . . . . . . 10 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → (𝐴 − (𝐺𝑧)) = (((𝐹𝑧) + (𝐺𝑧)) − (𝐺𝑧)))
29 ax-resscn 10185 . . . . . . . . . . . . . 14 ℝ ⊆ ℂ
30 fss 6217 . . . . . . . . . . . . . 14 ((𝐹:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐹:ℝ⟶ℂ)
313, 29, 30sylancl 697 . . . . . . . . . . . . 13 (𝜑𝐹:ℝ⟶ℂ)
3231ad2antrr 764 . . . . . . . . . . . 12 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → 𝐹:ℝ⟶ℂ)
3332, 19ffvelrnd 6523 . . . . . . . . . . 11 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → (𝐹𝑧) ∈ ℂ)
34 fss 6217 . . . . . . . . . . . . . 14 ((𝐺:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐺:ℝ⟶ℂ)
358, 29, 34sylancl 697 . . . . . . . . . . . . 13 (𝜑𝐺:ℝ⟶ℂ)
3635ad2antrr 764 . . . . . . . . . . . 12 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → 𝐺:ℝ⟶ℂ)
3736, 19ffvelrnd 6523 . . . . . . . . . . 11 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → (𝐺𝑧) ∈ ℂ)
3833, 37pncand 10585 . . . . . . . . . 10 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → (((𝐹𝑧) + (𝐺𝑧)) − (𝐺𝑧)) = (𝐹𝑧))
3928, 38eqtr2d 2795 . . . . . . . . 9 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → (𝐹𝑧) = (𝐴 − (𝐺𝑧)))
405ad2antrr 764 . . . . . . . . . 10 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → 𝐹 Fn ℝ)
41 fniniseg 6501 . . . . . . . . . 10 (𝐹 Fn ℝ → (𝑧 ∈ (𝐹 “ {(𝐴 − (𝐺𝑧))}) ↔ (𝑧 ∈ ℝ ∧ (𝐹𝑧) = (𝐴 − (𝐺𝑧)))))
4240, 41syl 17 . . . . . . . . 9 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → (𝑧 ∈ (𝐹 “ {(𝐴 − (𝐺𝑧))}) ↔ (𝑧 ∈ ℝ ∧ (𝐹𝑧) = (𝐴 − (𝐺𝑧)))))
4319, 39, 42mpbir2and 995 . . . . . . . 8 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ (𝐹 “ {(𝐴 − (𝐺𝑧))}))
44 eqidd 2761 . . . . . . . . 9 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → (𝐺𝑧) = (𝐺𝑧))
45 fniniseg 6501 . . . . . . . . . 10 (𝐺 Fn ℝ → (𝑧 ∈ (𝐺 “ {(𝐺𝑧)}) ↔ (𝑧 ∈ ℝ ∧ (𝐺𝑧) = (𝐺𝑧))))
4618, 45syl 17 . . . . . . . . 9 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → (𝑧 ∈ (𝐺 “ {(𝐺𝑧)}) ↔ (𝑧 ∈ ℝ ∧ (𝐺𝑧) = (𝐺𝑧))))
4719, 44, 46mpbir2and 995 . . . . . . . 8 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ (𝐺 “ {(𝐺𝑧)}))
4843, 47elind 3941 . . . . . . 7 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → 𝑧 ∈ ((𝐹 “ {(𝐴 − (𝐺𝑧))}) ∩ (𝐺 “ {(𝐺𝑧)})))
49 oveq2 6821 . . . . . . . . . . . 12 (𝑦 = (𝐺𝑧) → (𝐴𝑦) = (𝐴 − (𝐺𝑧)))
5049sneqd 4333 . . . . . . . . . . 11 (𝑦 = (𝐺𝑧) → {(𝐴𝑦)} = {(𝐴 − (𝐺𝑧))})
5150imaeq2d 5624 . . . . . . . . . 10 (𝑦 = (𝐺𝑧) → (𝐹 “ {(𝐴𝑦)}) = (𝐹 “ {(𝐴 − (𝐺𝑧))}))
52 sneq 4331 . . . . . . . . . . 11 (𝑦 = (𝐺𝑧) → {𝑦} = {(𝐺𝑧)})
5352imaeq2d 5624 . . . . . . . . . 10 (𝑦 = (𝐺𝑧) → (𝐺 “ {𝑦}) = (𝐺 “ {(𝐺𝑧)}))
5451, 53ineq12d 3958 . . . . . . . . 9 (𝑦 = (𝐺𝑧) → ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})) = ((𝐹 “ {(𝐴 − (𝐺𝑧))}) ∩ (𝐺 “ {(𝐺𝑧)})))
5554eleq2d 2825 . . . . . . . 8 (𝑦 = (𝐺𝑧) → (𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})) ↔ 𝑧 ∈ ((𝐹 “ {(𝐴 − (𝐺𝑧))}) ∩ (𝐺 “ {(𝐺𝑧)}))))
5655rspcev 3449 . . . . . . 7 (((𝐺𝑧) ∈ ran 𝐺𝑧 ∈ ((𝐹 “ {(𝐴 − (𝐺𝑧))}) ∩ (𝐺 “ {(𝐺𝑧)}))) → ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})))
5721, 48, 56syl2anc 696 . . . . . 6 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)) → ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})))
5857ex 449 . . . . 5 ((𝜑𝐴 ∈ ℂ) → ((𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴) → ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦}))))
59 elin 3939 . . . . . . 7 (𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})) ↔ (𝑧 ∈ (𝐹 “ {(𝐴𝑦)}) ∧ 𝑧 ∈ (𝐺 “ {𝑦})))
605adantr 472 . . . . . . . . . 10 ((𝜑𝐴 ∈ ℂ) → 𝐹 Fn ℝ)
61 fniniseg 6501 . . . . . . . . . 10 (𝐹 Fn ℝ → (𝑧 ∈ (𝐹 “ {(𝐴𝑦)}) ↔ (𝑧 ∈ ℝ ∧ (𝐹𝑧) = (𝐴𝑦))))
6260, 61syl 17 . . . . . . . . 9 ((𝜑𝐴 ∈ ℂ) → (𝑧 ∈ (𝐹 “ {(𝐴𝑦)}) ↔ (𝑧 ∈ ℝ ∧ (𝐹𝑧) = (𝐴𝑦))))
6310adantr 472 . . . . . . . . . 10 ((𝜑𝐴 ∈ ℂ) → 𝐺 Fn ℝ)
64 fniniseg 6501 . . . . . . . . . 10 (𝐺 Fn ℝ → (𝑧 ∈ (𝐺 “ {𝑦}) ↔ (𝑧 ∈ ℝ ∧ (𝐺𝑧) = 𝑦)))
6563, 64syl 17 . . . . . . . . 9 ((𝜑𝐴 ∈ ℂ) → (𝑧 ∈ (𝐺 “ {𝑦}) ↔ (𝑧 ∈ ℝ ∧ (𝐺𝑧) = 𝑦)))
6662, 65anbi12d 749 . . . . . . . 8 ((𝜑𝐴 ∈ ℂ) → ((𝑧 ∈ (𝐹 “ {(𝐴𝑦)}) ∧ 𝑧 ∈ (𝐺 “ {𝑦})) ↔ ((𝑧 ∈ ℝ ∧ (𝐹𝑧) = (𝐴𝑦)) ∧ (𝑧 ∈ ℝ ∧ (𝐺𝑧) = 𝑦))))
67 anandi 906 . . . . . . . . 9 ((𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦)) ↔ ((𝑧 ∈ ℝ ∧ (𝐹𝑧) = (𝐴𝑦)) ∧ (𝑧 ∈ ℝ ∧ (𝐺𝑧) = 𝑦)))
68 simprl 811 . . . . . . . . . . 11 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → 𝑧 ∈ ℝ)
6925ad2ant2r 800 . . . . . . . . . . . 12 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → ((𝐹𝑓 + 𝐺)‘𝑧) = ((𝐹𝑧) + (𝐺𝑧)))
70 simprrl 823 . . . . . . . . . . . . 13 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → (𝐹𝑧) = (𝐴𝑦))
71 simprrr 824 . . . . . . . . . . . . 13 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → (𝐺𝑧) = 𝑦)
7270, 71oveq12d 6831 . . . . . . . . . . . 12 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → ((𝐹𝑧) + (𝐺𝑧)) = ((𝐴𝑦) + 𝑦))
73 simplr 809 . . . . . . . . . . . . 13 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → 𝐴 ∈ ℂ)
7435ad2antrr 764 . . . . . . . . . . . . . . 15 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → 𝐺:ℝ⟶ℂ)
7574, 68ffvelrnd 6523 . . . . . . . . . . . . . 14 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → (𝐺𝑧) ∈ ℂ)
7671, 75eqeltrrd 2840 . . . . . . . . . . . . 13 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → 𝑦 ∈ ℂ)
7773, 76npcand 10588 . . . . . . . . . . . 12 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → ((𝐴𝑦) + 𝑦) = 𝐴)
7869, 72, 773eqtrd 2798 . . . . . . . . . . 11 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)
7968, 78jca 555 . . . . . . . . . 10 (((𝜑𝐴 ∈ ℂ) ∧ (𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦))) → (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴))
8079ex 449 . . . . . . . . 9 ((𝜑𝐴 ∈ ℂ) → ((𝑧 ∈ ℝ ∧ ((𝐹𝑧) = (𝐴𝑦) ∧ (𝐺𝑧) = 𝑦)) → (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)))
8167, 80syl5bir 233 . . . . . . . 8 ((𝜑𝐴 ∈ ℂ) → (((𝑧 ∈ ℝ ∧ (𝐹𝑧) = (𝐴𝑦)) ∧ (𝑧 ∈ ℝ ∧ (𝐺𝑧) = 𝑦)) → (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)))
8266, 81sylbid 230 . . . . . . 7 ((𝜑𝐴 ∈ ℂ) → ((𝑧 ∈ (𝐹 “ {(𝐴𝑦)}) ∧ 𝑧 ∈ (𝐺 “ {𝑦})) → (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)))
8359, 82syl5bi 232 . . . . . 6 ((𝜑𝐴 ∈ ℂ) → (𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})) → (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)))
8483rexlimdvw 3172 . . . . 5 ((𝜑𝐴 ∈ ℂ) → (∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})) → (𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴)))
8558, 84impbid 202 . . . 4 ((𝜑𝐴 ∈ ℂ) → ((𝑧 ∈ ℝ ∧ ((𝐹𝑓 + 𝐺)‘𝑧) = 𝐴) ↔ ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦}))))
8617, 85bitrd 268 . . 3 ((𝜑𝐴 ∈ ℂ) → (𝑧 ∈ ((𝐹𝑓 + 𝐺) “ {𝐴}) ↔ ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦}))))
87 eliun 4676 . . 3 (𝑧 𝑦 ∈ ran 𝐺((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})) ↔ ∃𝑦 ∈ ran 𝐺 𝑧 ∈ ((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})))
8886, 87syl6bbr 278 . 2 ((𝜑𝐴 ∈ ℂ) → (𝑧 ∈ ((𝐹𝑓 + 𝐺) “ {𝐴}) ↔ 𝑧 𝑦 ∈ ran 𝐺((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦}))))
8988eqrdv 2758 1 ((𝜑𝐴 ∈ ℂ) → ((𝐹𝑓 + 𝐺) “ {𝐴}) = 𝑦 ∈ ran 𝐺((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383   = wceq 1632  wcel 2139  wrex 3051  Vcvv 3340  cin 3714  wss 3715  {csn 4321   ciun 4672  ccnv 5265  dom cdm 5266  ran crn 5267  cima 5269   Fn wfn 6044  wf 6045  cfv 6049  (class class class)co 6813  𝑓 cof 7060  cc 10126  cr 10127   + caddc 10131  cmin 10458  1citg1 23583
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114  ax-cnex 10184  ax-resscn 10185  ax-1cn 10186  ax-icn 10187  ax-addcl 10188  ax-addrcl 10189  ax-mulcl 10190  ax-mulrcl 10191  ax-mulcom 10192  ax-addass 10193  ax-mulass 10194  ax-distr 10195  ax-i2m1 10196  ax-1ne0 10197  ax-1rid 10198  ax-rnegex 10199  ax-rrecex 10200  ax-cnre 10201  ax-pre-lttri 10202  ax-pre-lttrn 10203  ax-pre-ltadd 10204
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-id 5174  df-po 5187  df-so 5188  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-riota 6774  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-of 7062  df-er 7911  df-en 8122  df-dom 8123  df-sdom 8124  df-pnf 10268  df-mnf 10269  df-ltxr 10271  df-sub 10460  df-sum 14616  df-itg1 23588
This theorem is referenced by:  i1fadd  23661  itg1addlem4  23665
  Copyright terms: Public domain W3C validator