MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lmodfopnelem1 Structured version   Visualization version   GIF version

Theorem lmodfopnelem1 21226
Description: Lemma 1 for lmodfopne 21228. (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
StepHypRef Expression
1 lmodfopne.v . . . . 5 𝑉 = (Base‘𝑊)
2 lmodfopne.s . . . . 5 𝑆 = (Scalar‘𝑊)
3 lmodfopne.k . . . . 5 𝐾 = (Base‘𝑆)
4 lmodfopne.t . . . . 5 · = ( ·sf ‘𝑊)
51, 2, 3, 4lmodscaf 21212 . . . 4 (𝑊 ∈ LMod → · :(𝐾 × 𝑉)⟶𝑉)
65ffnd 6739 . . 3 (𝑊 ∈ LMod → · Fn (𝐾 × 𝑉))
7 lmodfopne.a . . . . 5 + = (+𝑓‘𝑊)
81, 7plusffn 18877 . . . 4 + Fn (𝑉 × 𝑉)
9 fneq1 6659 . . . . . . . . . . 11 ( + = · → ( + Fn (𝑉 × 𝑉) ↔ · Fn (𝑉 × 𝑉)))
10 fndmu 6675 . . . . . . . . . . . 12 (( · Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → (𝑉 × 𝑉) = (𝐾 × 𝑉))
1110ex 418 . . . . . . . . . . 11 ( · Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → (𝑉 × 𝑉) = (𝐾 × 𝑉)))
129, 11biimtrdi 256 . . . . . . . . . 10 ( + = · → ( + Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → (𝑉 × 𝑉) = (𝐾 × 𝑉))))
1312com13 89 . . . . . . . . 9 ( · Fn (𝐾 × 𝑉) → ( + Fn (𝑉 × 𝑉) → ( + = · → (𝑉 × 𝑉) = (𝐾 × 𝑉))))
1413impcom 413 . . . . . . . 8 (( + Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → ( + = · → (𝑉 × 𝑉) = (𝐾 × 𝑉)))
151lmodbn0 21199 . . . . . . . . . . 11 (𝑊 ∈ LMod → 𝑉 ≠ ∅)
16 xp11 6184 . . . . . . . . . . 11 ((𝑉 ≠ ∅ ∧ 𝑉 ≠ ∅) → ((𝑉 × 𝑉) = (𝐾 × 𝑉) ↔ (𝑉 = 𝐾 ∧ 𝑉 = 𝑉)))
1715, 15, 16syl2anc 596 . . . . . . . . . 10 (𝑊 ∈ LMod → ((𝑉 × 𝑉) = (𝐾 × 𝑉) ↔ (𝑉 = 𝐾 ∧ 𝑉 = 𝑉)))
1817simprbda 504 . . . . . . . . 9 ((𝑊 ∈ LMod ∧ (𝑉 × 𝑉) = (𝐾 × 𝑉)) → 𝑉 = 𝐾)
1918expcom 419 . . . . . . . 8 ((𝑉 × 𝑉) = (𝐾 × 𝑉) → (𝑊 ∈ LMod → 𝑉 = 𝐾))
2014, 19syl6 36 . . . . . . 7 (( + Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → ( + = · → (𝑊 ∈ LMod → 𝑉 = 𝐾)))
2120com23 87 . . . . . 6 (( + Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → (𝑊 ∈ LMod → ( + = · → 𝑉 = 𝐾)))
2221ex 418 . . . . 5 ( + Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → (𝑊 ∈ LMod → ( + = · → 𝑉 = 𝐾))))
2322com23 87 . . . 4 ( + Fn (𝑉 × 𝑉) → (𝑊 ∈ LMod → ( · Fn (𝐾 × 𝑉) → ( + = · → 𝑉 = 𝐾))))
248, 23ax-mp 5 . . 3 (𝑊 ∈ LMod → ( · Fn (𝐾 × 𝑉) → ( + = · → 𝑉 = 𝐾)))
256, 24mpd 16 . 2 (𝑊 ∈ LMod → ( + = · → 𝑉 = 𝐾))
2625imp 412 1 ((𝑊 ∈ LMod ∧ + = · ) → 𝑉 = 𝐾)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  ∅c0 4280   × cxp 5655   Fn wfn 6560  ‘cfv 6565  Basecbs 17433  Scalarcsca 17477  +𝑓cplusf 18865  LModclmod 21188   ·sf cscaf 21189
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-0g 17664  df-plusf 18867  df-mgm 18868  df-sgrp 18960  df-mnd 18976  df-grp 19199  df-lmod 21190  df-scaf 21191
This theorem is used by:  lmodfopnelem2  21227
  Copyright terms: Public domain W3C validator