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

Theorem lmodfopnelem1 14661
Description: Lemma 1 for lmodfopne 14663. (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 13685 . . 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 14646 . . 3  |-  ( W  e.  LMod  ->  .x.  Fn  ( K  X.  V
) )
8 fneq1 5469 . . . . . . . . . 10  |-  (  .+  =  .x.  ->  (  .+  Fn  ( V  X.  V
)  <->  .x.  Fn  ( V  X.  V ) ) )
9 fndmu 5484 . . . . . . . . . . 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 14630 . . . . . . . . . . 11  |-  ( W  e.  LMod  ->  W  e. 
Grp )
15 eqid 2238 . . . . . . . . . . . 12  |-  ( 0g
`  W )  =  ( 0g `  W
)
161, 15grpidcl 13834 . . . . . . . . . . 11  |-  ( W  e.  Grp  ->  ( 0g `  W )  e.  V )
17 elex2 2838 . . . . . . . . . . 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 5226 . . . . . . . . . 10  |-  ( ( E. w  w  e.  V  /\  E. w  w  e.  V )  ->  ( ( V  X.  V )  =  ( K  X.  V )  <-> 
( V  =  K  /\  V  =  V ) ) )
2018, 18, 19syl2anc 415 . . . . . . . . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402   E.wex 1545    e. wcel 2209    X. cxp 4772    Fn wfn 5372   ` cfv 5377   Basecbs 13352  Scalarcsca 13434   0gc0g 13610   +fcplusf 13673   Grpcgrp 13805   LModclmod 14623   .sfcscaf 14624
This proof depends on 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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof 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-rmo 2536  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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  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-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  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-plusg 13444  df-mulr 13445  df-sca 13447  df-vsca 13448  df-0g 13612  df-plusf 13675  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-lmod 14625  df-scaf 14626
This theorem is used by:  lmodfopnelem2  14662
  Copyright terms: Public domain W3C validator