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

Theorem lmodpropd 14445
Description: If two structures have the same components (properties), one is a left module iff the other one is. (Contributed by Mario Carneiro, 8-Feb-2015.) (Revised by Mario Carneiro, 27-Jun-2015.)
Hypotheses
Ref Expression
lmodpropd.1  |-  ( ph  ->  B  =  ( Base `  K ) )
lmodpropd.2  |-  ( ph  ->  B  =  ( Base `  L ) )
lmodpropd.3  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B ) )  -> 
( x ( +g  `  K ) y )  =  ( x ( +g  `  L ) y ) )
lmodpropd.4  |-  ( ph  ->  F  =  (Scalar `  K ) )
lmodpropd.5  |-  ( ph  ->  F  =  (Scalar `  L ) )
lmodpropd.6  |-  P  =  ( Base `  F
)
lmodpropd.7  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  B ) )  -> 
( x ( .s
`  K ) y )  =  ( x ( .s `  L
) y ) )
Assertion
Ref Expression
lmodpropd  |-  ( ph  ->  ( K  e.  LMod  <->  L  e.  LMod ) )
Distinct variable groups:    x, y, B   
x, K, y    x, L, y    x, P, y    ph, x, y
Allowed substitution hints:    F( x, y)

Proof of Theorem lmodpropd
StepHypRef Expression
1 lmodpropd.1 . 2  |-  ( ph  ->  B  =  ( Base `  K ) )
2 lmodpropd.2 . 2  |-  ( ph  ->  B  =  ( Base `  L ) )
3 eqid 2231 . 2  |-  (Scalar `  K )  =  (Scalar `  K )
4 eqid 2231 . 2  |-  (Scalar `  L )  =  (Scalar `  L )
5 lmodpropd.6 . . 3  |-  P  =  ( Base `  F
)
6 lmodpropd.4 . . . 4  |-  ( ph  ->  F  =  (Scalar `  K ) )
76fveq2d 5652 . . 3  |-  ( ph  ->  ( Base `  F
)  =  ( Base `  (Scalar `  K )
) )
85, 7eqtrid 2276 . 2  |-  ( ph  ->  P  =  ( Base `  (Scalar `  K )
) )
9 lmodpropd.5 . . . 4  |-  ( ph  ->  F  =  (Scalar `  L ) )
109fveq2d 5652 . . 3  |-  ( ph  ->  ( Base `  F
)  =  ( Base `  (Scalar `  L )
) )
115, 10eqtrid 2276 . 2  |-  ( ph  ->  P  =  ( Base `  (Scalar `  L )
) )
12 lmodpropd.3 . 2  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B ) )  -> 
( x ( +g  `  K ) y )  =  ( x ( +g  `  L ) y ) )
136, 9eqtr3d 2266 . . . . 5  |-  ( ph  ->  (Scalar `  K )  =  (Scalar `  L )
)
1413adantr 276 . . . 4  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  P ) )  -> 
(Scalar `  K )  =  (Scalar `  L )
)
1514fveq2d 5652 . . 3  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  P ) )  -> 
( +g  `  (Scalar `  K ) )  =  ( +g  `  (Scalar `  L ) ) )
1615oveqd 6045 . 2  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  P ) )  -> 
( x ( +g  `  (Scalar `  K )
) y )  =  ( x ( +g  `  (Scalar `  L )
) y ) )
1714fveq2d 5652 . . 3  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  P ) )  -> 
( .r `  (Scalar `  K ) )  =  ( .r `  (Scalar `  L ) ) )
1817oveqd 6045 . 2  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  P ) )  -> 
( x ( .r
`  (Scalar `  K )
) y )  =  ( x ( .r
`  (Scalar `  L )
) y ) )
19 lmodpropd.7 . 2  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  B ) )  -> 
( x ( .s
`  K ) y )  =  ( x ( .s `  L
) y ) )
201, 2, 3, 4, 8, 11, 12, 16, 18, 19lmodprop2d 14444 1  |-  ( ph  ->  ( K  e.  LMod  <->  L  e.  LMod ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   ` cfv 5333  (class class class)co 6028   Basecbs 13162   +g cplusg 13240   .rcmulr 13241  Scalarcsca 13243   .scvsca 13244   LModclmod 14383
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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-pre-ltirr 8204  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-ltxr 8278  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-5 9264  df-6 9265  df-ndx 13165  df-slot 13166  df-base 13168  df-sets 13169  df-plusg 13253  df-mulr 13254  df-sca 13256  df-vsca 13257  df-0g 13421  df-mgm 13519  df-sgrp 13565  df-mnd 13580  df-grp 13666  df-mgp 14015  df-ur 14054  df-ring 14092  df-lmod 14385
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator