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

Theorem isassad 21845
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
StepHypRef Expression
1 isassad.1 . . 3 (𝜑𝑊 ∈ LMod)
2 isassad.2 . . 3 (𝜑𝑊 ∈ Ring)
31, 2jca 511 . 2 (𝜑 → (𝑊 ∈ LMod ∧ 𝑊 ∈ Ring))
4 isassad.4 . . . . 5 ((𝜑 ∧ (𝑟𝐵𝑥𝑉𝑦𝑉)) → ((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)))
5 isassad.5 . . . . 5 ((𝜑 ∧ (𝑟𝐵𝑥𝑉𝑦𝑉)) → (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦)))
64, 5jca 511 . . . 4 ((𝜑 ∧ (𝑟𝐵𝑥𝑉𝑦𝑉)) → (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))))
76ralrimivvva 3183 . . 3 (𝜑 → ∀𝑟𝐵𝑥𝑉𝑦𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))))
8 isassad.b . . . . 5 (𝜑𝐵 = (Base‘𝐹))
9 isassad.f . . . . . 6 (𝜑𝐹 = (Scalar‘𝑊))
109fveq2d 6844 . . . . 5 (𝜑 → (Base‘𝐹) = (Base‘(Scalar‘𝑊)))
118, 10eqtrd 2771 . . . 4 (𝜑𝐵 = (Base‘(Scalar‘𝑊)))
12 isassad.v . . . . 5 (𝜑𝑉 = (Base‘𝑊))
13 isassad.t . . . . . . . . 9 (𝜑× = (.r𝑊))
14 isassad.s . . . . . . . . . 10 (𝜑· = ( ·𝑠𝑊))
1514oveqd 7384 . . . . . . . . 9 (𝜑 → (𝑟 · 𝑥) = (𝑟( ·𝑠𝑊)𝑥))
16 eqidd 2737 . . . . . . . . 9 (𝜑𝑦 = 𝑦)
1713, 15, 16oveq123d 7388 . . . . . . . 8 (𝜑 → ((𝑟 · 𝑥) × 𝑦) = ((𝑟( ·𝑠𝑊)𝑥)(.r𝑊)𝑦))
18 eqidd 2737 . . . . . . . . 9 (𝜑𝑟 = 𝑟)
1913oveqd 7384 . . . . . . . . 9 (𝜑 → (𝑥 × 𝑦) = (𝑥(.r𝑊)𝑦))
2014, 18, 19oveq123d 7388 . . . . . . . 8 (𝜑 → (𝑟 · (𝑥 × 𝑦)) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)))
2117, 20eqeq12d 2752 . . . . . . 7 (𝜑 → (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ↔ ((𝑟( ·𝑠𝑊)𝑥)(.r𝑊)𝑦) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦))))
22 eqidd 2737 . . . . . . . . 9 (𝜑𝑥 = 𝑥)
2314oveqd 7384 . . . . . . . . 9 (𝜑 → (𝑟 · 𝑦) = (𝑟( ·𝑠𝑊)𝑦))
2413, 22, 23oveq123d 7388 . . . . . . . 8 (𝜑 → (𝑥 × (𝑟 · 𝑦)) = (𝑥(.r𝑊)(𝑟( ·𝑠𝑊)𝑦)))
2524, 20eqeq12d 2752 . . . . . . 7 (𝜑 → ((𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦)) ↔ (𝑥(.r𝑊)(𝑟( ·𝑠𝑊)𝑦)) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦))))
2621, 25anbi12d 633 . . . . . 6 (𝜑 → ((((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ (((𝑟( ·𝑠𝑊)𝑥)(.r𝑊)𝑦) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)) ∧ (𝑥(.r𝑊)(𝑟( ·𝑠𝑊)𝑦)) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)))))
2712, 26raleqbidv 3311 . . . . 5 (𝜑 → (∀𝑦𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ ∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠𝑊)𝑥)(.r𝑊)𝑦) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)) ∧ (𝑥(.r𝑊)(𝑟( ·𝑠𝑊)𝑦)) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)))))
2812, 27raleqbidv 3311 . . . 4 (𝜑 → (∀𝑥𝑉𝑦𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ ∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠𝑊)𝑥)(.r𝑊)𝑦) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)) ∧ (𝑥(.r𝑊)(𝑟( ·𝑠𝑊)𝑦)) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)))))
2911, 28raleqbidv 3311 . . 3 (𝜑 → (∀𝑟𝐵𝑥𝑉𝑦𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ ∀𝑟 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠𝑊)𝑥)(.r𝑊)𝑦) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)) ∧ (𝑥(.r𝑊)(𝑟( ·𝑠𝑊)𝑦)) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)))))
307, 29mpbid 232 . 2 (𝜑 → ∀𝑟 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠𝑊)𝑥)(.r𝑊)𝑦) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)) ∧ (𝑥(.r𝑊)(𝑟( ·𝑠𝑊)𝑦)) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦))))
31 eqid 2736 . . 3 (Base‘𝑊) = (Base‘𝑊)
32 eqid 2736 . . 3 (Scalar‘𝑊) = (Scalar‘𝑊)
33 eqid 2736 . . 3 (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
34 eqid 2736 . . 3 ( ·𝑠𝑊) = ( ·𝑠𝑊)
35 eqid 2736 . . 3 (.r𝑊) = (.r𝑊)
3631, 32, 33, 34, 35isassa 21836 . 2 (𝑊 ∈ AssAlg ↔ ((𝑊 ∈ LMod ∧ 𝑊 ∈ Ring) ∧ ∀𝑟 ∈ (Base‘(Scalar‘𝑊))∀𝑥 ∈ (Base‘𝑊)∀𝑦 ∈ (Base‘𝑊)(((𝑟( ·𝑠𝑊)𝑥)(.r𝑊)𝑦) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)) ∧ (𝑥(.r𝑊)(𝑟( ·𝑠𝑊)𝑦)) = (𝑟( ·𝑠𝑊)(𝑥(.r𝑊)𝑦)))))
373, 30, 36sylanbrc 584 1 (𝜑𝑊 ∈ AssAlg)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3051  cfv 6498  (class class class)co 7367  Basecbs 17179  .rcmulr 17221  Scalarcsca 17223   ·𝑠 cvsca 17224  Ringcrg 20214  LModclmod 20855  AssAlgcasa 21830
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-nul 5241
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-iota 6454  df-fv 6506  df-ov 7370  df-assa 21833
This theorem is referenced by:  issubassa3  21846  sraassab  21848  zlmassa  21883  psrassa  21951  matassa  22409  mendassa  43618
  Copyright terms: Public domain W3C validator