Theorem stoweidlem6 42284

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

Hypotheses

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

Assertion

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

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

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

Proof of Theorem stoweidlem6

Step	Hyp	Ref	Expression
1		simp3 1134	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴) → 𝐺 ∈ 𝐴)
2		eleq1 2900	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑔 ∈ 𝐴 ↔ 𝐺 ∈ 𝐴))
3	2	3anbi3d 1438	. . . 4 ⊢ (𝑔 = 𝐺 → ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) ↔ (𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴)))
4		stoweidlem6.2	. . . . . 6 ⊢ Ⅎ𝑡 𝑔 = 𝐺
5		fveq1 6664	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝑔‘𝑡) = (𝐺‘𝑡))
6	5	oveq2d 7166	. . . . . . 7 ⊢ (𝑔 = 𝐺 → ((𝐹‘𝑡) · (𝑔‘𝑡)) = ((𝐹‘𝑡) · (𝐺‘𝑡)))
7	6	adantr 483	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑡 ∈ 𝑇) → ((𝐹‘𝑡) · (𝑔‘𝑡)) = ((𝐹‘𝑡) · (𝐺‘𝑡)))
8	4, 7	mpteq2da 5153	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝑔‘𝑡))) = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝐺‘𝑡))))
9	8	eleq1d 2897	. . . 4 ⊢ (𝑔 = 𝐺 → ((𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴 ↔ (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝐺‘𝑡))) ∈ 𝐴))
10	3, 9	imbi12d 347	. . 3 ⊢ (𝑔 = 𝐺 → (((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴) ↔ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝐺‘𝑡))) ∈ 𝐴)))
11		simp2 1133	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → 𝐹 ∈ 𝐴)
12		eleq1 2900	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓 ∈ 𝐴 ↔ 𝐹 ∈ 𝐴))
13	12	3anbi2d 1437	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) ↔ (𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴)))
14		stoweidlem6.1	. . . . . . . 8 ⊢ Ⅎ𝑡 𝑓 = 𝐹
15		fveq1 6664	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑡) = (𝐹‘𝑡))
16	15	oveq1d 7165	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑡) · (𝑔‘𝑡)) = ((𝐹‘𝑡) · (𝑔‘𝑡)))
17	16	adantr 483	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑡 ∈ 𝑇) → ((𝑓‘𝑡) · (𝑔‘𝑡)) = ((𝐹‘𝑡) · (𝑔‘𝑡)))
18	14, 17	mpteq2da 5153	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝑔‘𝑡))))
19	18	eleq1d 2897	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴 ↔ (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴))
20	13, 19	imbi12d 347	. . . . 5 ⊢ (𝑓 = 𝐹 → (((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴) ↔ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)))
21		stoweidlem6.3	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
22	20, 21	vtoclg 3568	. . . 4 ⊢ (𝐹 ∈ 𝐴 → ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴))
23	11, 22	mpcom 38	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
24	10, 23	vtoclg 3568	. 2 ⊢ (𝐺 ∈ 𝐴 → ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝐺‘𝑡))) ∈ 𝐴))
25	1, 24	mpcom 38	1 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐺 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝐺‘𝑡))) ∈ 𝐴)

Syntax hints:   → wi 4   ∧ w3a 1083   = wceq 1533  Ⅎwnf 1780   ∈ wcel 2110   ↦ cmpt 5139  ‘cfv 6350  (class class class)co 7150   · cmul 10536

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3497  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-br 5060  df-opab 5122  df-mpt 5140  df-iota 6309  df-fv 6358  df-ov 7153

This theorem is referenced by:  stoweidlem19  42297  stoweidlem22  42300  stoweidlem32  42310  stoweidlem36  42314