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

Theorem lmodfopnelem1 14328
Description: Lemma 1 for lmodfopne 14330. (Contributed by AV, 2-Oct-2021.)
Hypotheses
Ref Expression
lmodfopne.t · = ( ·sf𝑊)
lmodfopne.a + = (+𝑓𝑊)
lmodfopne.v 𝑉 = (Base‘𝑊)
lmodfopne.s 𝑆 = (Scalar‘𝑊)
lmodfopne.k 𝐾 = (Base‘𝑆)
Assertion
Ref Expression
lmodfopnelem1 ((𝑊 ∈ LMod ∧ + = · ) → 𝑉 = 𝐾)

Proof of Theorem lmodfopnelem1
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 lmodfopne.v . . . 4 𝑉 = (Base‘𝑊)
2 lmodfopne.a . . . 4 + = (+𝑓𝑊)
31, 2plusffng 13438 . . 3 (𝑊 ∈ LMod → + Fn (𝑉 × 𝑉))
4 lmodfopne.s . . . 4 𝑆 = (Scalar‘𝑊)
5 lmodfopne.k . . . 4 𝐾 = (Base‘𝑆)
6 lmodfopne.t . . . 4 · = ( ·sf𝑊)
71, 4, 5, 6scaffng 14313 . . 3 (𝑊 ∈ LMod → · Fn (𝐾 × 𝑉))
8 fneq1 5415 . . . . . . . . . 10 ( + = · → ( + Fn (𝑉 × 𝑉) ↔ · Fn (𝑉 × 𝑉)))
9 fndmu 5430 . . . . . . . . . . 11 (( · Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → (𝑉 × 𝑉) = (𝐾 × 𝑉))
109ex 115 . . . . . . . . . 10 ( · Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → (𝑉 × 𝑉) = (𝐾 × 𝑉)))
118, 10biimtrdi 163 . . . . . . . . 9 ( + = · → ( + Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → (𝑉 × 𝑉) = (𝐾 × 𝑉))))
1211com13 80 . . . . . . . 8 ( · Fn (𝐾 × 𝑉) → ( + Fn (𝑉 × 𝑉) → ( + = · → (𝑉 × 𝑉) = (𝐾 × 𝑉))))
1312impcom 125 . . . . . . 7 (( + Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → ( + = · → (𝑉 × 𝑉) = (𝐾 × 𝑉)))
14 lmodgrp 14298 . . . . . . . . . . 11 (𝑊 ∈ LMod → 𝑊 ∈ Grp)
15 eqid 2229 . . . . . . . . . . . 12 (0g𝑊) = (0g𝑊)
161, 15grpidcl 13602 . . . . . . . . . . 11 (𝑊 ∈ Grp → (0g𝑊) ∈ 𝑉)
17 elex2 2817 . . . . . . . . . . 11 ((0g𝑊) ∈ 𝑉 → ∃𝑤 𝑤𝑉)
1814, 16, 173syl 17 . . . . . . . . . 10 (𝑊 ∈ LMod → ∃𝑤 𝑤𝑉)
19 xp11m 5173 . . . . . . . . . 10 ((∃𝑤 𝑤𝑉 ∧ ∃𝑤 𝑤𝑉) → ((𝑉 × 𝑉) = (𝐾 × 𝑉) ↔ (𝑉 = 𝐾𝑉 = 𝑉)))
2018, 18, 19syl2anc 411 . . . . . . . . 9 (𝑊 ∈ LMod → ((𝑉 × 𝑉) = (𝐾 × 𝑉) ↔ (𝑉 = 𝐾𝑉 = 𝑉)))
2120simprbda 383 . . . . . . . 8 ((𝑊 ∈ LMod ∧ (𝑉 × 𝑉) = (𝐾 × 𝑉)) → 𝑉 = 𝐾)
2221expcom 116 . . . . . . 7 ((𝑉 × 𝑉) = (𝐾 × 𝑉) → (𝑊 ∈ LMod → 𝑉 = 𝐾))
2313, 22syl6 33 . . . . . 6 (( + Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → ( + = · → (𝑊 ∈ LMod → 𝑉 = 𝐾)))
2423com23 78 . . . . 5 (( + Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → (𝑊 ∈ LMod → ( + = ·𝑉 = 𝐾)))
2524ex 115 . . . 4 ( + Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → (𝑊 ∈ LMod → ( + = ·𝑉 = 𝐾))))
2625com3r 79 . . 3 (𝑊 ∈ LMod → ( + Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → ( + = ·𝑉 = 𝐾))))
273, 7, 26mp2d 47 . 2 (𝑊 ∈ LMod → ( + = ·𝑉 = 𝐾))
2827imp 124 1 ((𝑊 ∈ LMod ∧ + = · ) → 𝑉 = 𝐾)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1395  wex 1538  wcel 2200   × cxp 4721   Fn wfn 5319  cfv 5324  Basecbs 13072  Scalarcsca 13153  0gc0g 13329  +𝑓cplusf 13426  Grpcgrp 13573  LModclmod 14291   ·sf cscaf 14292
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-cnex 8113  ax-resscn 8114  ax-1re 8116  ax-addrcl 8119
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-inn 9134  df-2 9192  df-3 9193  df-4 9194  df-5 9195  df-6 9196  df-ndx 13075  df-slot 13076  df-base 13078  df-plusg 13163  df-mulr 13164  df-sca 13166  df-vsca 13167  df-0g 13331  df-plusf 13428  df-mgm 13429  df-sgrp 13475  df-mnd 13490  df-grp 13576  df-lmod 14293  df-scaf 14294
This theorem is referenced by:  lmodfopnelem2  14329
  Copyright terms: Public domain W3C validator