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

Theorem lmodfopne 14646
Description: The (functionalized) operations of a left module (over a nonzero ring) cannot be identical. (Contributed by NM, 31-May-2008.) (Revised by AV, 2-Oct-2021.)
Hypotheses
Ref Expression
lmodfopne.t · = ( ·sf𝑊)
lmodfopne.a + = (+𝑓𝑊)
lmodfopne.v 𝑉 = (Base‘𝑊)
lmodfopne.s 𝑆 = (Scalar‘𝑊)
lmodfopne.k 𝐾 = (Base‘𝑆)
lmodfopne.0 0 = (0g𝑆)
lmodfopne.1 1 = (1r𝑆)
Assertion
Ref Expression
lmodfopne ((𝑊 ∈ LMod ∧ 10 ) → +· )

Proof of Theorem lmodfopne
StepHypRef Expression
1 lmodfopne.t . . . . . 6 · = ( ·sf𝑊)
2 lmodfopne.a . . . . . 6 + = (+𝑓𝑊)
3 lmodfopne.v . . . . . 6 𝑉 = (Base‘𝑊)
4 lmodfopne.s . . . . . 6 𝑆 = (Scalar‘𝑊)
5 lmodfopne.k . . . . . 6 𝐾 = (Base‘𝑆)
6 lmodfopne.0 . . . . . 6 0 = (0g𝑆)
7 lmodfopne.1 . . . . . 6 1 = (1r𝑆)
81, 2, 3, 4, 5, 6, 7lmodfopnelem2 14645 . . . . 5 ((𝑊 ∈ LMod ∧ + = · ) → ( 0𝑉1𝑉))
9 simpll 531 . . . . . . . 8 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → 𝑊 ∈ LMod)
10 simpl 109 . . . . . . . . 9 (( 0𝑉1𝑉) → 0𝑉)
1110adantl 277 . . . . . . . 8 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → 0𝑉)
12 eqid 2238 . . . . . . . . . 10 (0g𝑊) = (0g𝑊)
133, 12lmod0vcl 14637 . . . . . . . . 9 (𝑊 ∈ LMod → (0g𝑊) ∈ 𝑉)
1413ad2antrr 492 . . . . . . . 8 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → (0g𝑊) ∈ 𝑉)
15 eqid 2238 . . . . . . . . . 10 (+g𝑊) = (+g𝑊)
163, 15, 2plusfvalg 13666 . . . . . . . . 9 ((𝑊 ∈ LMod ∧ 0𝑉 ∧ (0g𝑊) ∈ 𝑉) → ( 0 + (0g𝑊)) = ( 0 (+g𝑊)(0g𝑊)))
1716eqcomd 2244 . . . . . . . 8 ((𝑊 ∈ LMod ∧ 0𝑉 ∧ (0g𝑊) ∈ 𝑉) → ( 0 (+g𝑊)(0g𝑊)) = ( 0 + (0g𝑊)))
189, 11, 14, 17syl3anc 1278 . . . . . . 7 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 0 (+g𝑊)(0g𝑊)) = ( 0 + (0g𝑊)))
19 oveq 6085 . . . . . . . 8 ( + = · → ( 0 + (0g𝑊)) = ( 0 · (0g𝑊)))
2019ad2antlr 493 . . . . . . 7 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 0 + (0g𝑊)) = ( 0 · (0g𝑊)))
2118, 20eqtrd 2271 . . . . . 6 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 0 (+g𝑊)(0g𝑊)) = ( 0 · (0g𝑊)))
22 lmodgrp 14613 . . . . . . . 8 (𝑊 ∈ LMod → 𝑊 ∈ Grp)
2322adantr 276 . . . . . . 7 ((𝑊 ∈ LMod ∧ + = · ) → 𝑊 ∈ Grp)
243, 15, 12grprid 13820 . . . . . . 7 ((𝑊 ∈ Grp ∧ 0𝑉) → ( 0 (+g𝑊)(0g𝑊)) = 0 )
2523, 10, 24syl2an 289 . . . . . 6 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 0 (+g𝑊)(0g𝑊)) = 0 )
264, 5, 6lmod0cl 14634 . . . . . . . . 9 (𝑊 ∈ LMod → 0𝐾)
2726ad2antrr 492 . . . . . . . 8 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → 0𝐾)
28 eqid 2238 . . . . . . . . 9 ( ·𝑠𝑊) = ( ·𝑠𝑊)
293, 4, 5, 1, 28scafvalg 14627 . . . . . . . 8 ((𝑊 ∈ LMod ∧ 0𝐾 ∧ (0g𝑊) ∈ 𝑉) → ( 0 · (0g𝑊)) = ( 0 ( ·𝑠𝑊)(0g𝑊)))
309, 27, 14, 29syl3anc 1278 . . . . . . 7 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 0 · (0g𝑊)) = ( 0 ( ·𝑠𝑊)(0g𝑊)))
3126ancli 323 . . . . . . . . 9 (𝑊 ∈ LMod → (𝑊 ∈ LMod ∧ 0𝐾))
3231ad2antrr 492 . . . . . . . 8 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → (𝑊 ∈ LMod ∧ 0𝐾))
334, 28, 5, 12lmodvs0 14642 . . . . . . . 8 ((𝑊 ∈ LMod ∧ 0𝐾) → ( 0 ( ·𝑠𝑊)(0g𝑊)) = (0g𝑊))
3432, 33syl 14 . . . . . . 7 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 0 ( ·𝑠𝑊)(0g𝑊)) = (0g𝑊))
35 simpr 110 . . . . . . . . . 10 (( 0𝑉1𝑉) → 1𝑉)
363, 15, 12grprid 13820 . . . . . . . . . 10 ((𝑊 ∈ Grp ∧ 1𝑉) → ( 1 (+g𝑊)(0g𝑊)) = 1 )
3723, 35, 36syl2an 289 . . . . . . . . 9 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 1 (+g𝑊)(0g𝑊)) = 1 )
384, 5, 7lmod1cl 14635 . . . . . . . . . . . 12 (𝑊 ∈ LMod → 1𝐾)
3938ad2antrr 492 . . . . . . . . . . 11 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → 1𝐾)
4035adantl 277 . . . . . . . . . . 11 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → 1𝑉)
413, 4, 5, 1, 28scafvalg 14627 . . . . . . . . . . 11 ((𝑊 ∈ LMod ∧ 1𝐾1𝑉) → ( 1 · 1 ) = ( 1 ( ·𝑠𝑊) 1 ))
429, 39, 40, 41syl3anc 1278 . . . . . . . . . 10 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 1 · 1 ) = ( 1 ( ·𝑠𝑊) 1 ))
433, 4, 28, 7lmodvs1 14636 . . . . . . . . . . 11 ((𝑊 ∈ LMod ∧ 1𝑉) → ( 1 ( ·𝑠𝑊) 1 ) = 1 )
4443ad2ant2rl 515 . . . . . . . . . 10 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 1 ( ·𝑠𝑊) 1 ) = 1 )
4542, 44eqtrd 2271 . . . . . . . . 9 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 1 · 1 ) = 1 )
46 oveq 6085 . . . . . . . . . . . 12 ( + = · → ( 1 + 1 ) = ( 1 · 1 ))
4746eqcomd 2244 . . . . . . . . . . 11 ( + = · → ( 1 · 1 ) = ( 1 + 1 ))
4847ad2antlr 493 . . . . . . . . . 10 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 1 · 1 ) = ( 1 + 1 ))
493, 15, 2plusfvalg 13666 . . . . . . . . . . 11 ((𝑊 ∈ LMod ∧ 1𝑉1𝑉) → ( 1 + 1 ) = ( 1 (+g𝑊) 1 ))
509, 40, 40, 49syl3anc 1278 . . . . . . . . . 10 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 1 + 1 ) = ( 1 (+g𝑊) 1 ))
5148, 50eqtrd 2271 . . . . . . . . 9 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 1 · 1 ) = ( 1 (+g𝑊) 1 ))
5237, 45, 513eqtr2d 2277 . . . . . . . 8 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 1 (+g𝑊)(0g𝑊)) = ( 1 (+g𝑊) 1 ))
5322ad2antrr 492 . . . . . . . . 9 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → 𝑊 ∈ Grp)
543, 15grplcan 13850 . . . . . . . . 9 ((𝑊 ∈ Grp ∧ ((0g𝑊) ∈ 𝑉1𝑉1𝑉)) → (( 1 (+g𝑊)(0g𝑊)) = ( 1 (+g𝑊) 1 ) ↔ (0g𝑊) = 1 ))
5553, 14, 40, 40, 54syl13anc 1280 . . . . . . . 8 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → (( 1 (+g𝑊)(0g𝑊)) = ( 1 (+g𝑊) 1 ) ↔ (0g𝑊) = 1 ))
5652, 55mpbid 147 . . . . . . 7 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → (0g𝑊) = 1 )
5730, 34, 563eqtrd 2275 . . . . . 6 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → ( 0 · (0g𝑊)) = 1 )
5821, 25, 573eqtr3rd 2280 . . . . 5 (((𝑊 ∈ LMod ∧ + = · ) ∧ ( 0𝑉1𝑉)) → 1 = 0 )
598, 58mpdan 425 . . . 4 ((𝑊 ∈ LMod ∧ + = · ) → 1 = 0 )
6059ex 115 . . 3 (𝑊 ∈ LMod → ( + = ·1 = 0 ))
6160necon3d 2464 . 2 (𝑊 ∈ LMod → ( 10+· ))
6261imp 124 1 ((𝑊 ∈ LMod ∧ 10 ) → +· )
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1009   = wceq 1402  wcel 2209  wne 2420  cfv 5375  (class class class)co 6079  Basecbs 13335  +gcplusg 13414  Scalarcsca 13417   ·𝑠 cvsca 13418  0gc0g 13593  +𝑓cplusf 13656  Grpcgrp 13788  1rcur 14245  LModclmod 14606   ·sf cscaf 14607
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 623  ax-in2 624  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-setind 4682  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-addcom 8273  ax-addass 8275  ax-i2m1 8278  ax-0lt1 8279  ax-0id 8281  ax-rnegex 8282  ax-pre-ltirr 8285  ax-pre-ltadd 8289
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  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-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  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-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-pnf 8356  df-mnf 8357  df-ltxr 8359  df-inn 9288  df-2 9346  df-3 9347  df-4 9348  df-5 9349  df-6 9350  df-ndx 13338  df-slot 13339  df-base 13341  df-sets 13342  df-plusg 13427  df-mulr 13428  df-sca 13430  df-vsca 13431  df-0g 13595  df-plusf 13658  df-mgm 13659  df-sgrp 13700  df-mnd 13713  df-grp 13791  df-minusg 13792  df-mgp 14201  df-ur 14246  df-ring 14285  df-lmod 14608  df-scaf 14609
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator