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

Theorem lmodpropd 14497
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 2232 . 2  |-  (Scalar `  K )  =  (Scalar `  K )
4 eqid 2232 . 2  |-  (Scalar `  L )  =  (Scalar `  L )
5 lmodpropd.6 . . 3  |-  P  =  ( Base `  F
)
6 lmodpropd.4 . . . 4  |-  ( ph  ->  F  =  (Scalar `  K ) )
76fveq2d 5674 . . 3  |-  ( ph  ->  ( Base `  F
)  =  ( Base `  (Scalar `  K )
) )
85, 7eqtrid 2277 . 2  |-  ( ph  ->  P  =  ( Base `  (Scalar `  K )
) )
9 lmodpropd.5 . . . 4  |-  ( ph  ->  F  =  (Scalar `  L ) )
109fveq2d 5674 . . 3  |-  ( ph  ->  ( Base `  F
)  =  ( Base `  (Scalar `  L )
) )
115, 10eqtrid 2277 . 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 2267 . . . . 5  |-  ( ph  ->  (Scalar `  K )  =  (Scalar `  L )
)
1413adantr 276 . . . 4  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  P ) )  -> 
(Scalar `  K )  =  (Scalar `  L )
)
1514fveq2d 5674 . . 3  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  P ) )  -> 
( +g  `  (Scalar `  K ) )  =  ( +g  `  (Scalar `  L ) ) )
1615oveqd 6067 . 2  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  P ) )  -> 
( x ( +g  `  (Scalar `  K )
) y )  =  ( x ( +g  `  (Scalar `  L )
) y ) )
1714fveq2d 5674 . . 3  |-  ( (
ph  /\  ( x  e.  P  /\  y  e.  P ) )  -> 
( .r `  (Scalar `  K ) )  =  ( .r `  (Scalar `  L ) ) )
1817oveqd 6067 . 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 14496 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 2203   ` cfv 5352  (class class class)co 6050   Basecbs 13212   +g cplusg 13290   .rcmulr 13291  Scalarcsca 13293   .scvsca 13294   LModclmod 14435
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 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-inn 9238  df-2 9296  df-3 9297  df-4 9298  df-5 9299  df-6 9300  df-ndx 13215  df-slot 13216  df-base 13218  df-sets 13219  df-plusg 13303  df-mulr 13304  df-sca 13306  df-vsca 13307  df-0g 13471  df-mgm 13569  df-sgrp 13615  df-mnd 13630  df-grp 13716  df-mgp 14065  df-ur 14104  df-ring 14142  df-lmod 14437
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator