Theorem isassad 22052

Description: Sufficient condition for being an associative algebra. (Contributed by Mario Carneiro, 5-Dec-2014.) (Revised by SN, 2-Mar-2025.)

Hypotheses

Ref	Expression
isassad.v	⊢ (𝜑 → 𝑉 = (Base‘𝑊))
isassad.f	⊢ (𝜑 → 𝐹 = (Scalar‘𝑊))
isassad.b	⊢ (𝜑 → 𝐵 = (Base‘𝐹))
isassad.s	⊢ (𝜑 → · = ( ·𝑠 ‘𝑊))
isassad.t	⊢ (𝜑 → × = (.r‘𝑊))
isassad.1	⊢ (𝜑 → 𝑊 ∈ LMod)
isassad.2	⊢ (𝜑 → 𝑊 ∈ Ring)
isassad.4	⊢ ((𝜑 ∧ (𝑟 ∈ 𝐵 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → ((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)))
isassad.5	⊢ ((𝜑 ∧ (𝑟 ∈ 𝐵 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦)))

Assertion

Ref	Expression
isassad	⊢ (𝜑 → 𝑊 ∈ AssAlg)

Distinct variable groups:   𝑥,𝑟,𝑦,𝐵   𝜑,𝑟,𝑥,𝑦   𝑥,𝑉,𝑦   𝑊,𝑟,𝑥,𝑦

Allowed substitution hints:   · (𝑥, 𝑦, 𝑟)   × (𝑥, 𝑦, 𝑟)   𝐹(𝑥, 𝑦, 𝑟)   𝑉(𝑟)

Proof of Theorem isassad

Step	Hyp	Ref	Expression
1		isassad.1	. . 3 ⊢ (𝜑 → 𝑊 ∈ LMod)
2		isassad.2	. . 3 ⊢ (𝜑 → 𝑊 ∈ Ring)
3	1, 2	jca 521	. 2 ⊢ (𝜑 → (𝑊 ∈ LMod ∧ 𝑊 ∈ Ring))
4		isassad.4	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝐵 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → ((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)))
5		isassad.5	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝐵 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦)))
6	4, 5	jca 521	. . . 4 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝐵 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))))
7	6	ralrimivvva 3214	. . 3 ⊢ (𝜑 → ∀𝑟 ∈ 𝐵 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))))
8		isassad.b	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐹))
9		isassad.f	. . . . . 6 ⊢ (𝜑 → 𝐹 = (Scalar‘𝑊))
10	9	fveq2d 6892	. . . . 5 ⊢ (𝜑 → (Base‘𝐹) = (Base‘(Scalar‘𝑊)))
11	8, 10	eqtrd 2801	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘(Scalar‘𝑊)))
12		isassad.v	. . . . 5 ⊢ (𝜑 → 𝑉 = (Base‘𝑊))
13		isassad.t	. . . . . . . . 9 ⊢ (𝜑 → × = (.r‘𝑊))
14		isassad.s	. . . . . . . . . 10 ⊢ (𝜑 → · = ( ·𝑠 ‘𝑊))
15	14	oveqd 7440	. . . . . . . . 9 ⊢ (𝜑 → (𝑟 · 𝑥) = (𝑟( ·𝑠 ‘𝑊)𝑥))
16		eqidd 2767	. . . . . . . . 9 ⊢ (𝜑 → 𝑦 = 𝑦)
17	13, 15, 16	oveq123d 7444	. . . . . . . 8 ⊢ (𝜑 → ((𝑟 · 𝑥) × 𝑦) = ((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦))
18		eqidd 2767	. . . . . . . . 9 ⊢ (𝜑 → 𝑟 = 𝑟)
19	13	oveqd 7440	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 × 𝑦) = (𝑥(.r‘𝑊)𝑦))
20	14, 18, 19	oveq123d 7444	. . . . . . . 8 ⊢ (𝜑 → (𝑟 · (𝑥 × 𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))
21	17, 20	eqeq12d 2782	. . . . . . 7 ⊢ (𝜑 → (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ↔ ((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦))))
22		eqidd 2767	. . . . . . . . 9 ⊢ (𝜑 → 𝑥 = 𝑥)
23	14	oveqd 7440	. . . . . . . . 9 ⊢ (𝜑 → (𝑟 · 𝑦) = (𝑟( ·𝑠 ‘𝑊)𝑦))
24	13, 22, 23	oveq123d 7444	. . . . . . . 8 ⊢ (𝜑 → (𝑥 × (𝑟 · 𝑦)) = (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)))
25	24, 20	eqeq12d 2782	. . . . . . 7 ⊢ (𝜑 → ((𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦)) ↔ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦))))
26	21, 25	anbi12d 644	. . . . . 6 ⊢ (𝜑 → ((((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ (((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
27	12, 26	raleqbidv 3341	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ ∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
28	12, 27	raleqbidv 3341	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ ∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
29	11, 28	raleqbidv 3341	. . 3 ⊢ (𝜑 → (∀𝑟 ∈ 𝐵 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ ∀𝑟 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
30	7, 29	mpbid 235	. 2 ⊢ (𝜑 → ∀𝑟 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦))))
31		eqid 2766	. . 3 ⊢ (Base‘𝑊) = (Base‘𝑊)
32		eqid 2766	. . 3 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
33		eqid 2766	. . 3 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
34		eqid 2766	. . 3 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
35		eqid 2766	. . 3 ⊢ (.r‘𝑊) = (.r‘𝑊)
36	31, 32, 33, 34, 35	isassa 22043	. 2 ⊢ (𝑊 ∈ AssAlg ↔ ((𝑊 ∈ LMod ∧ 𝑊 ∈ Ring) ∧ ∀𝑟 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
37	3, 30, 36	sylanbrc 595	1 ⊢ (𝜑 → 𝑊 ∈ AssAlg)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3082  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  ._rcmulr 17336  Scalarcsca 17338   ·_𝑠 cvsca 17339  Ringcrg 20346  LModclmod 21018  AssAlgcasa 22037

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-nul 5274

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-iota 6499  df-fv 6551  df-ov 7426  df-assa 22040

This theorem is used by:  issubassa3  22053  sraassab  22055  zlmassa  22090  psrassa  22159  matassa  22638  mendassa  43958