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

Theorem asclpropd 15023
Description: If two structures have the same components (properties), one is an associative algebra iff the other one is. The last hypotheses on  1r can be discharged either by letting  W  =  _V (if strong equality is known on  .s) or assuming  K is a ring. (Contributed by Mario Carneiro, 5-Jul-2015.)
Hypotheses
Ref Expression
asclpropd.f  |-  F  =  (Scalar `  K )
asclpropd.g  |-  G  =  (Scalar `  L )
asclpropd.1  |-  ( ph  ->  P  =  ( Base `  F ) )
asclpropd.2  |-  ( ph  ->  P  =  ( Base `  G ) )
asclpropd.3  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  W ) )  -> 
( x ( .s
`  K ) y )  =  ( x ( .s `  L
) y ) )
asclpropd.4  |-  ( ph  ->  ( 1r `  K
)  =  ( 1r
`  L ) )
asclpropd.5  |-  ( ph  ->  ( 1r `  K
)  e.  W )
Assertion
Ref Expression
asclpropd  |-  ( ph  ->  (algSc `  K )  =  (algSc `  L )
)
Distinct variable groups:    x, y, K   
x, L, y    x, P, y    ph, x, y   
x, W, y
Allowed substitution hints:    F( x, y)    G( x, y)

Proof of Theorem asclpropd
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 asclpropd.5 . . . . . 6  |-  ( ph  ->  ( 1r `  K
)  e.  W )
2 asclpropd.3 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  W ) )  -> 
( x ( .s
`  K ) y )  =  ( x ( .s `  L
) y ) )
32oveqrspc2v 6106 . . . . . . 7  |-  ( (
ph  /\  ( z  e.  P  /\  ( 1r `  K )  e.  W ) )  -> 
( z ( .s
`  K ) ( 1r `  K ) )  =  ( z ( .s `  L
) ( 1r `  K ) ) )
43anassrs 404 . . . . . 6  |-  ( ( ( ph  /\  z  e.  P )  /\  ( 1r `  K )  e.  W )  ->  (
z ( .s `  K ) ( 1r
`  K ) )  =  ( z ( .s `  L ) ( 1r `  K
) ) )
51, 4mpidan 427 . . . . 5  |-  ( (
ph  /\  z  e.  P )  ->  (
z ( .s `  K ) ( 1r
`  K ) )  =  ( z ( .s `  L ) ( 1r `  K
) ) )
6 asclpropd.4 . . . . . . 7  |-  ( ph  ->  ( 1r `  K
)  =  ( 1r
`  L ) )
76oveq2d 6095 . . . . . 6  |-  ( ph  ->  ( z ( .s
`  L ) ( 1r `  K ) )  =  ( z ( .s `  L
) ( 1r `  L ) ) )
87adantr 276 . . . . 5  |-  ( (
ph  /\  z  e.  P )  ->  (
z ( .s `  L ) ( 1r
`  K ) )  =  ( z ( .s `  L ) ( 1r `  L
) ) )
95, 8eqtrd 2271 . . . 4  |-  ( (
ph  /\  z  e.  P )  ->  (
z ( .s `  K ) ( 1r
`  K ) )  =  ( z ( .s `  L ) ( 1r `  L
) ) )
109mpteq2dva 4219 . . 3  |-  ( ph  ->  ( z  e.  P  |->  ( z ( .s
`  K ) ( 1r `  K ) ) )  =  ( z  e.  P  |->  ( z ( .s `  L ) ( 1r
`  L ) ) ) )
11 asclpropd.1 . . . 4  |-  ( ph  ->  P  =  ( Base `  F ) )
1211mpteq1d 4214 . . 3  |-  ( ph  ->  ( z  e.  P  |->  ( z ( .s
`  K ) ( 1r `  K ) ) )  =  ( z  e.  ( Base `  F )  |->  ( z ( .s `  K
) ( 1r `  K ) ) ) )
13 asclpropd.2 . . . 4  |-  ( ph  ->  P  =  ( Base `  G ) )
1413mpteq1d 4214 . . 3  |-  ( ph  ->  ( z  e.  P  |->  ( z ( .s
`  L ) ( 1r `  L ) ) )  =  ( z  e.  ( Base `  G )  |->  ( z ( .s `  L
) ( 1r `  L ) ) ) )
1510, 12, 143eqtr3d 2279 . 2  |-  ( ph  ->  ( z  e.  (
Base `  F )  |->  ( z ( .s
`  K ) ( 1r `  K ) ) )  =  ( z  e.  ( Base `  G )  |->  ( z ( .s `  L
) ( 1r `  L ) ) ) )
16 eqid 2238 . . 3  |-  (algSc `  K )  =  (algSc `  K )
17 asclpropd.f . . 3  |-  F  =  (Scalar `  K )
18 eqid 2238 . . 3  |-  ( Base `  F )  =  (
Base `  F )
19 eqid 2238 . . 3  |-  ( .s
`  K )  =  ( .s `  K
)
20 eqid 2238 . . 3  |-  ( 1r
`  K )  =  ( 1r `  K
)
2116, 17, 18, 19, 20asclfval 15004 . 2  |-  (algSc `  K )  =  ( z  e.  ( Base `  F )  |->  ( z ( .s `  K
) ( 1r `  K ) ) )
22 eqid 2238 . . 3  |-  (algSc `  L )  =  (algSc `  L )
23 asclpropd.g . . 3  |-  G  =  (Scalar `  L )
24 eqid 2238 . . 3  |-  ( Base `  G )  =  (
Base `  G )
25 eqid 2238 . . 3  |-  ( .s
`  L )  =  ( .s `  L
)
26 eqid 2238 . . 3  |-  ( 1r
`  L )  =  ( 1r `  L
)
2722, 23, 24, 25, 26asclfval 15004 . 2  |-  (algSc `  L )  =  ( z  e.  ( Base `  G )  |->  ( z ( .s `  L
) ( 1r `  L ) ) )
2815, 21, 273eqtr4g 2296 1  |-  ( ph  ->  (algSc `  K )  =  (algSc `  L )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    |-> cmpt 4190   ` cfv 5375  (class class class)co 6079   Basecbs 13335  Scalarcsca 13417   .scvsca 13418   1rcur 14245  algSccascl 14981
This theorem was proved from 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-coll 4244  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-cnex 8264  ax-resscn 8265  ax-1re 8267  ax-addrcl 8270
This theorem 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-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-ov 6082  df-inn 9288  df-2 9346  df-3 9347  df-4 9348  df-5 9349  df-ndx 13338  df-slot 13339  df-base 13341  df-sca 13430  df-ascl 14984
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator