ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  assa2ass2 Unicode version

Theorem assa2ass2 15010
Description: Left- and right-associative property of an associative algebra. Notice that the scalars are not commuted! (Contributed by Zhi Wang, 11-Sep-2025.)
Hypotheses
Ref Expression
assa2ass.v  |-  V  =  ( Base `  W
)
assa2ass.f  |-  F  =  (Scalar `  W )
assa2ass.b  |-  B  =  ( Base `  F
)
assa2ass.m  |-  .*  =  ( .r `  F )
assa2ass.s  |-  .x.  =  ( .s `  W )
assa2ass.t  |-  .X.  =  ( .r `  W )
Assertion
Ref Expression
assa2ass2  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  (
( A  .x.  X
)  .X.  ( C  .x.  Y ) )  =  ( ( A  .*  C )  .x.  ( X  .X.  Y ) ) )

Proof of Theorem assa2ass2
StepHypRef Expression
1 simp1 1028 . . 3  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  W  e. AssAlg )
2 simpl 109 . . . 4  |-  ( ( A  e.  B  /\  C  e.  B )  ->  A  e.  B )
323ad2ant2 1050 . . 3  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  A  e.  B )
4 simpl 109 . . . 4  |-  ( ( X  e.  V  /\  Y  e.  V )  ->  X  e.  V )
543ad2ant3 1051 . . 3  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  X  e.  V )
6 assa2ass.v . . . 4  |-  V  =  ( Base `  W
)
7 assa2ass.f . . . 4  |-  F  =  (Scalar `  W )
8 assa2ass.s . . . 4  |-  .x.  =  ( .s `  W )
9 assa2ass.b . . . 4  |-  B  =  ( Base `  F
)
10 assalmod 15006 . . . . 5  |-  ( W  e. AssAlg  ->  W  e.  LMod )
11103ad2ant1 1049 . . . 4  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  W  e.  LMod )
12 simpr 110 . . . . 5  |-  ( ( A  e.  B  /\  C  e.  B )  ->  C  e.  B )
13123ad2ant2 1050 . . . 4  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  C  e.  B )
14 simpr 110 . . . . 5  |-  ( ( X  e.  V  /\  Y  e.  V )  ->  Y  e.  V )
15143ad2ant3 1051 . . . 4  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  Y  e.  V )
166, 7, 8, 9, 11, 13, 15lmodvscld 14642 . . 3  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  ( C  .x.  Y )  e.  V )
17 assa2ass.t . . . 4  |-  .X.  =  ( .r `  W )
186, 7, 9, 8, 17assaass 15004 . . 3  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  X  e.  V  /\  ( C  .x.  Y )  e.  V ) )  ->  ( ( A 
.x.  X )  .X.  ( C  .x.  Y ) )  =  ( A 
.x.  ( X  .X.  ( C  .x.  Y ) ) ) )
191, 3, 5, 16, 18syl13anc 1280 . 2  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  (
( A  .x.  X
)  .X.  ( C  .x.  Y ) )  =  ( A  .x.  ( X  .X.  ( C  .x.  Y ) ) ) )
206, 7, 9, 8, 17assaassr 15005 . . . 4  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  X  e.  V  /\  ( C  .x.  Y )  e.  V ) )  ->  ( X  .X.  ( A  .x.  ( C 
.x.  Y ) ) )  =  ( A 
.x.  ( X  .X.  ( C  .x.  Y ) ) ) )
2120eqcomd 2244 . . 3  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  X  e.  V  /\  ( C  .x.  Y )  e.  V ) )  ->  ( A  .x.  ( X  .X.  ( C 
.x.  Y ) ) )  =  ( X 
.X.  ( A  .x.  ( C  .x.  Y ) ) ) )
221, 3, 5, 16, 21syl13anc 1280 . 2  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  ( A  .x.  ( X  .X.  ( C  .x.  Y ) ) )  =  ( X  .X.  ( A  .x.  ( C  .x.  Y
) ) ) )
23 assa2ass.m . . . . . . 7  |-  .*  =  ( .r `  F )
246, 7, 8, 9, 23lmodvsass 14650 . . . . . 6  |-  ( ( W  e.  LMod  /\  ( A  e.  B  /\  C  e.  B  /\  Y  e.  V )
)  ->  ( ( A  .*  C )  .x.  Y )  =  ( A  .x.  ( C 
.x.  Y ) ) )
2524eqcomd 2244 . . . . 5  |-  ( ( W  e.  LMod  /\  ( A  e.  B  /\  C  e.  B  /\  Y  e.  V )
)  ->  ( A  .x.  ( C  .x.  Y
) )  =  ( ( A  .*  C
)  .x.  Y )
)
2625oveq2d 6101 . . . 4  |-  ( ( W  e.  LMod  /\  ( A  e.  B  /\  C  e.  B  /\  Y  e.  V )
)  ->  ( X  .X.  ( A  .x.  ( C  .x.  Y ) ) )  =  ( X 
.X.  ( ( A  .*  C )  .x.  Y ) ) )
2711, 3, 13, 15, 26syl13anc 1280 . . 3  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  ( X  .X.  ( A  .x.  ( C  .x.  Y ) ) )  =  ( X  .X.  ( ( A  .*  C )  .x.  Y ) ) )
287assasca 15008 . . . . . . 7  |-  ( W  e. AssAlg  ->  F  e.  Ring )
2928adantr 276 . . . . . 6  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )
)  ->  F  e.  Ring )
302adantl 277 . . . . . 6  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )
)  ->  A  e.  B )
3112adantl 277 . . . . . 6  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )
)  ->  C  e.  B )
329, 23, 29, 30, 31ringcld 14322 . . . . 5  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )
)  ->  ( A  .*  C )  e.  B
)
33323adant3 1048 . . . 4  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  ( A  .*  C )  e.  B )
346, 7, 9, 8, 17assaassr 15005 . . . 4  |-  ( ( W  e. AssAlg  /\  (
( A  .*  C
)  e.  B  /\  X  e.  V  /\  Y  e.  V )
)  ->  ( X  .X.  ( ( A  .*  C )  .x.  Y
) )  =  ( ( A  .*  C
)  .x.  ( X  .X.  Y ) ) )
351, 33, 5, 15, 34syl13anc 1280 . . 3  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  ( X  .X.  ( ( A  .*  C )  .x.  Y ) )  =  ( ( A  .*  C )  .x.  ( X  .X.  Y ) ) )
3627, 35eqtrd 2271 . 2  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  ( X  .X.  ( A  .x.  ( C  .x.  Y ) ) )  =  ( ( A  .*  C
)  .x.  ( X  .X.  Y ) ) )
3719, 22, 363eqtrd 2275 1  |-  ( ( W  e. AssAlg  /\  ( A  e.  B  /\  C  e.  B )  /\  ( X  e.  V  /\  Y  e.  V
) )  ->  (
( A  .x.  X
)  .X.  ( C  .x.  Y ) )  =  ( ( A  .*  C )  .x.  ( X  .X.  Y ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209   ` cfv 5377  (class class class)co 6085   Basecbs 13352   .rcmulr 13432  Scalarcsca 13434   .scvsca 13435   Ringcrg 14300   LModclmod 14623  AssAlgcasa 14996
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  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-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-plusg 13444  df-mulr 13445  df-sca 13447  df-vsca 13448  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-mgp 14218  df-ring 14302  df-lmod 14625  df-assa 14999
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator