Theorem isassad 15095

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 306	. 2 ⊢ (𝜑 → (𝑊 ∈ LMod ∧ 𝑊 ∈ Ring))
4		isassad.4	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝐵 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → ((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)))
5		isassad.5	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝐵 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦)))
6	4, 5	jca 306	. . . 4 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝐵 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))))
7	6	ralrimivvva 2633	. . 3 ⊢ (𝜑 → ∀𝑟 ∈ 𝐵 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))))
8		isassad.b	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐹))
9		isassad.f	. . . . . 6 ⊢ (𝜑 → 𝐹 = (Scalar‘𝑊))
10	9	fveq2d 5699	. . . . 5 ⊢ (𝜑 → (Base‘𝐹) = (Base‘(Scalar‘𝑊)))
11	8, 10	eqtrd 2271	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘(Scalar‘𝑊)))
12		isassad.v	. . . . 5 ⊢ (𝜑 → 𝑉 = (Base‘𝑊))
13		isassad.t	. . . . . . . . 9 ⊢ (𝜑 → × = (.r‘𝑊))
14		isassad.s	. . . . . . . . . 10 ⊢ (𝜑 → · = ( ·𝑠 ‘𝑊))
15	14	oveqd 6102	. . . . . . . . 9 ⊢ (𝜑 → (𝑟 · 𝑥) = (𝑟( ·𝑠 ‘𝑊)𝑥))
16		eqidd 2239	. . . . . . . . 9 ⊢ (𝜑 → 𝑦 = 𝑦)
17	13, 15, 16	oveq123d 6106	. . . . . . . 8 ⊢ (𝜑 → ((𝑟 · 𝑥) × 𝑦) = ((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦))
18		eqidd 2239	. . . . . . . . 9 ⊢ (𝜑 → 𝑟 = 𝑟)
19	13	oveqd 6102	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 × 𝑦) = (𝑥(.r‘𝑊)𝑦))
20	14, 18, 19	oveq123d 6106	. . . . . . . 8 ⊢ (𝜑 → (𝑟 · (𝑥 × 𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))
21	17, 20	eqeq12d 2253	. . . . . . 7 ⊢ (𝜑 → (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ↔ ((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦))))
22		eqidd 2239	. . . . . . . . 9 ⊢ (𝜑 → 𝑥 = 𝑥)
23	14	oveqd 6102	. . . . . . . . 9 ⊢ (𝜑 → (𝑟 · 𝑦) = (𝑟( ·𝑠 ‘𝑊)𝑦))
24	13, 22, 23	oveq123d 6106	. . . . . . . 8 ⊢ (𝜑 → (𝑥 × (𝑟 · 𝑦)) = (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)))
25	24, 20	eqeq12d 2253	. . . . . . 7 ⊢ (𝜑 → ((𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦)) ↔ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦))))
26	21, 25	anbi12d 477	. . . . . 6 ⊢ (𝜑 → ((((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ (((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
27	12, 26	raleqbidv 2765	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ ∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
28	12, 27	raleqbidv 2765	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ ∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
29	11, 28	raleqbidv 2765	. . 3 ⊢ (𝜑 → (∀𝑟 ∈ 𝐵 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ ∀𝑟 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
30	7, 29	mpbid 147	. 2 ⊢ (𝜑 → ∀𝑟 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦))))
31		eqid 2238	. . 3 ⊢ (Base‘𝑊) = (Base‘𝑊)
32		eqid 2238	. . 3 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
33		eqid 2238	. . 3 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
34		eqid 2238	. . 3 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
35		eqid 2238	. . 3 ⊢ (.r‘𝑊) = (.r‘𝑊)
36	31, 32, 33, 34, 35	isassa 15086	. 2 ⊢ (𝑊 ∈ AssAlg ↔ ((𝑊 ∈ LMod ∧ 𝑊 ∈ Ring) ∧ ∀𝑟 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠 ‘𝑊)𝑥)(.r‘𝑊)𝑦) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)) ∧ (𝑥(.r‘𝑊)(𝑟( ·𝑠 ‘𝑊)𝑦)) = (𝑟( ·𝑠 ‘𝑊)(𝑥(.r‘𝑊)𝑦)))))
37	3, 30, 36	sylanbrc 421	1 ⊢ (𝜑 → 𝑊 ∈ AssAlg)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  ._rcmulr 13485  Scalarcsca 13487   ·_𝑠 cvsca 13488  Ringcrg 14384  LModclmod 14707  AssAlgcasa 15080

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9308  df-2 9366  df-3 9367  df-4 9368  df-5 9369  df-6 9370  df-ndx 13407  df-slot 13408  df-mulr 13498  df-sca 13500  df-vsca 13501  df-assa 15083

This theorem is used by:  issubassa3  15096