Theorem stoweidlem8 45967

Description: Lemma for stoweid 46022: two class variables replace two setvar variables, for the sum of two functions. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypotheses

Ref	Expression
stoweidlem8.1	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem8.2	⊢ Ⅎ𝑡𝐹
stoweidlem8.3	⊢ Ⅎ𝑡𝐺

Assertion

Ref	Expression
stoweidlem8	⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝐺‘𝑡))) ∈ 𝐴)

Distinct variable groups:   𝑓,𝑔,𝑡   𝐴,𝑓,𝑔   𝑓,𝐹,𝑔   𝑇,𝑓,𝑔   𝜑,𝑓,𝑔   𝑔,𝐺

Allowed substitution hints:   𝜑(𝑡)   𝐴(𝑡)   𝑇(𝑡)   𝐹(𝑡)   𝐺(𝑡,𝑓)

Proof of Theorem stoweidlem8

Step	Hyp	Ref	Expression
1		simp3 1138	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴) → 𝐺 ∈ 𝐴)
2		eleq1 2821	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑔 ∈ 𝐴 ↔ 𝐺 ∈ 𝐴))
3	2	3anbi3d 1443	. . . 4 ⊢ (𝑔 = 𝐺 → ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) ↔ (𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴)))
4		stoweidlem8.3	. . . . . . 7 ⊢ Ⅎ𝑡𝐺
5	4	nfeq2 2915	. . . . . 6 ⊢ Ⅎ𝑡 𝑔 = 𝐺
6		fveq1 6871	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝑔‘𝑡) = (𝐺‘𝑡))
7	6	oveq2d 7415	. . . . . . 7 ⊢ (𝑔 = 𝐺 → ((𝐹‘𝑡) + (𝑔‘𝑡)) = ((𝐹‘𝑡) + (𝐺‘𝑡)))
8	7	adantr 480	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑡 ∈ 𝑇) → ((𝐹‘𝑡) + (𝑔‘𝑡)) = ((𝐹‘𝑡) + (𝐺‘𝑡)))
9	5, 8	mpteq2da 5210	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝑔‘𝑡))) = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝐺‘𝑡))))
10	9	eleq1d 2818	. . . 4 ⊢ (𝑔 = 𝐺 → ((𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴 ↔ (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝐺‘𝑡))) ∈ 𝐴))
11	3, 10	imbi12d 344	. . 3 ⊢ (𝑔 = 𝐺 → (((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴) ↔ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝐺‘𝑡))) ∈ 𝐴)))
12		simp2 1137	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → 𝐹 ∈ 𝐴)
13		eleq1 2821	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓 ∈ 𝐴 ↔ 𝐹 ∈ 𝐴))
14	13	3anbi2d 1442	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) ↔ (𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴)))
15		stoweidlem8.2	. . . . . . . . 9 ⊢ Ⅎ𝑡𝐹
16	15	nfeq2 2915	. . . . . . . 8 ⊢ Ⅎ𝑡 𝑓 = 𝐹
17		fveq1 6871	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑡) = (𝐹‘𝑡))
18	17	oveq1d 7414	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑡) + (𝑔‘𝑡)) = ((𝐹‘𝑡) + (𝑔‘𝑡)))
19	18	adantr 480	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑡 ∈ 𝑇) → ((𝑓‘𝑡) + (𝑔‘𝑡)) = ((𝐹‘𝑡) + (𝑔‘𝑡)))
20	16, 19	mpteq2da 5210	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝑔‘𝑡))))
21	20	eleq1d 2818	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴 ↔ (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴))
22	14, 21	imbi12d 344	. . . . 5 ⊢ (𝑓 = 𝐹 → (((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴) ↔ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)))
23		stoweidlem8.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
24	22, 23	vtoclg 3531	. . . 4 ⊢ (𝐹 ∈ 𝐴 → ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴))
25	12, 24	mpcom 38	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
26	11, 25	vtoclg 3531	. 2 ⊢ (𝐺 ∈ 𝐴 → ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝐺‘𝑡))) ∈ 𝐴))
27	1, 26	mpcom 38	1 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) + (𝐺‘𝑡))) ∈ 𝐴)

Syntax hints:   → wi 4   ∧ w3a 1086   = wceq 1539   ∈ wcel 2107  Ⅎwnfc 2882   ↦ cmpt 5198  ‘cfv 6527  (class class class)co 7399   + caddc 11124

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-rab 3414  df-v 3459  df-dif 3927  df-un 3929  df-ss 3941  df-nul 4307  df-if 4499  df-sn 4600  df-pr 4602  df-op 4606  df-uni 4881  df-br 5117  df-opab 5179  df-mpt 5199  df-iota 6480  df-fv 6535  df-ov 7402

This theorem is referenced by:  stoweidlem20  45979  stoweidlem21  45980  stoweidlem22  45981  stoweidlem23  45982