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

Theorem lmodfopnelem1 14420
Description: Lemma 1 for lmodfopne 14422. (Contributed by AV, 2-Oct-2021.)
Hypotheses
Ref Expression
lmodfopne.t  |-  .x.  =  ( .sf `  W
)
lmodfopne.a  |-  .+  =  ( +f `  W
)
lmodfopne.v  |-  V  =  ( Base `  W
)
lmodfopne.s  |-  S  =  (Scalar `  W )
lmodfopne.k  |-  K  =  ( Base `  S
)
Assertion
Ref Expression
lmodfopnelem1  |-  ( ( W  e.  LMod  /\  .+  =  .x.  )  ->  V  =  K )

Proof of Theorem lmodfopnelem1
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 lmodfopne.v . . . 4  |-  V  =  ( Base `  W
)
2 lmodfopne.a . . . 4  |-  .+  =  ( +f `  W
)
31, 2plusffng 13528 . . 3  |-  ( W  e.  LMod  ->  .+  Fn  ( V  X.  V
) )
4 lmodfopne.s . . . 4  |-  S  =  (Scalar `  W )
5 lmodfopne.k . . . 4  |-  K  =  ( Base `  S
)
6 lmodfopne.t . . . 4  |-  .x.  =  ( .sf `  W
)
71, 4, 5, 6scaffng 14405 . . 3  |-  ( W  e.  LMod  ->  .x.  Fn  ( K  X.  V
) )
8 fneq1 5425 . . . . . . . . . 10  |-  (  .+  =  .x.  ->  (  .+  Fn  ( V  X.  V
)  <->  .x.  Fn  ( V  X.  V ) ) )
9 fndmu 5440 . . . . . . . . . . 11  |-  ( ( 
.x.  Fn  ( V  X.  V )  /\  .x.  Fn  ( K  X.  V
) )  ->  ( V  X.  V )  =  ( K  X.  V
) )
109ex 115 . . . . . . . . . 10  |-  (  .x.  Fn  ( V  X.  V
)  ->  (  .x.  Fn  ( K  X.  V
)  ->  ( V  X.  V )  =  ( K  X.  V ) ) )
118, 10biimtrdi 163 . . . . . . . . 9  |-  (  .+  =  .x.  ->  (  .+  Fn  ( V  X.  V
)  ->  (  .x.  Fn  ( K  X.  V
)  ->  ( V  X.  V )  =  ( K  X.  V ) ) ) )
1211com13 80 . . . . . . . 8  |-  (  .x.  Fn  ( K  X.  V
)  ->  (  .+  Fn  ( V  X.  V
)  ->  (  .+  =  .x.  ->  ( V  X.  V )  =  ( K  X.  V ) ) ) )
1312impcom 125 . . . . . . 7  |-  ( ( 
.+  Fn  ( V  X.  V )  /\  .x.  Fn  ( K  X.  V
) )  ->  (  .+  =  .x.  ->  ( V  X.  V )  =  ( K  X.  V
) ) )
14 lmodgrp 14390 . . . . . . . . . . 11  |-  ( W  e.  LMod  ->  W  e. 
Grp )
15 eqid 2231 . . . . . . . . . . . 12  |-  ( 0g
`  W )  =  ( 0g `  W
)
161, 15grpidcl 13692 . . . . . . . . . . 11  |-  ( W  e.  Grp  ->  ( 0g `  W )  e.  V )
17 elex2 2820 . . . . . . . . . . 11  |-  ( ( 0g `  W )  e.  V  ->  E. w  w  e.  V )
1814, 16, 173syl 17 . . . . . . . . . 10  |-  ( W  e.  LMod  ->  E. w  w  e.  V )
19 xp11m 5182 . . . . . . . . . 10  |-  ( ( E. w  w  e.  V  /\  E. w  w  e.  V )  ->  ( ( V  X.  V )  =  ( K  X.  V )  <-> 
( V  =  K  /\  V  =  V ) ) )
2018, 18, 19syl2anc 411 . . . . . . . . 9  |-  ( W  e.  LMod  ->  ( ( V  X.  V )  =  ( K  X.  V )  <->  ( V  =  K  /\  V  =  V ) ) )
2120simprbda 383 . . . . . . . 8  |-  ( ( W  e.  LMod  /\  ( V  X.  V )  =  ( K  X.  V
) )  ->  V  =  K )
2221expcom 116 . . . . . . 7  |-  ( ( V  X.  V )  =  ( K  X.  V )  ->  ( W  e.  LMod  ->  V  =  K ) )
2313, 22syl6 33 . . . . . 6  |-  ( ( 
.+  Fn  ( V  X.  V )  /\  .x.  Fn  ( K  X.  V
) )  ->  (  .+  =  .x.  ->  ( W  e.  LMod  ->  V  =  K ) ) )
2423com23 78 . . . . 5  |-  ( ( 
.+  Fn  ( V  X.  V )  /\  .x.  Fn  ( K  X.  V
) )  ->  ( W  e.  LMod  ->  (  .+  =  .x.  ->  V  =  K ) ) )
2524ex 115 . . . 4  |-  (  .+  Fn  ( V  X.  V
)  ->  (  .x.  Fn  ( K  X.  V
)  ->  ( W  e.  LMod  ->  (  .+  =  .x.  ->  V  =  K ) ) ) )
2625com3r 79 . . 3  |-  ( W  e.  LMod  ->  (  .+  Fn  ( V  X.  V
)  ->  (  .x.  Fn  ( K  X.  V
)  ->  (  .+  =  .x.  ->  V  =  K ) ) ) )
273, 7, 26mp2d 47 . 2  |-  ( W  e.  LMod  ->  (  .+  =  .x.  ->  V  =  K ) )
2827imp 124 1  |-  ( ( W  e.  LMod  /\  .+  =  .x.  )  ->  V  =  K )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398   E.wex 1541    e. wcel 2202    X. cxp 4729    Fn wfn 5328   ` cfv 5333   Basecbs 13162  Scalarcsca 13243   0gc0g 13419   +fcplusf 13516   Grpcgrp 13663   LModclmod 14383   .sfcscaf 14384
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 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-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  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-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  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-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  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-plusg 13253  df-mulr 13254  df-sca 13256  df-vsca 13257  df-0g 13421  df-plusf 13518  df-mgm 13519  df-sgrp 13565  df-mnd 13580  df-grp 13666  df-lmod 14385  df-scaf 14386
This theorem is referenced by:  lmodfopnelem2  14421
  Copyright terms: Public domain W3C validator