Theorem lmodfopnelem1 14661

Description: Lemma 1 for lmodfopne 14663. (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.

Step	Hyp	Ref	Expression
1		lmodfopne.v	. . . 4 ⊢ 𝑉 = (Base‘𝑊)
2		lmodfopne.a	. . . 4 ⊢ + = (+𝑓‘𝑊)
3	1, 2	plusffng 13685	. . 3 ⊢ (𝑊 ∈ LMod → + Fn (𝑉 × 𝑉))
4		lmodfopne.s	. . . 4 ⊢ 𝑆 = (Scalar‘𝑊)
5		lmodfopne.k	. . . 4 ⊢ 𝐾 = (Base‘𝑆)
6		lmodfopne.t	. . . 4 ⊢ · = ( ·sf ‘𝑊)
7	1, 4, 5, 6	scaffng 14646	. . 3 ⊢ (𝑊 ∈ LMod → · Fn (𝐾 × 𝑉))
8		fneq1 5469	. . . . . . . . . 10 ⊢ ( + = · → ( + Fn (𝑉 × 𝑉) ↔ · Fn (𝑉 × 𝑉)))
9		fndmu 5484	. . . . . . . . . . 11 ⊢ (( · Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → (𝑉 × 𝑉) = (𝐾 × 𝑉))
10	9	ex 115	. . . . . . . . . 10 ⊢ ( · Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → (𝑉 × 𝑉) = (𝐾 × 𝑉)))
11	8, 10	biimtrdi 163	. . . . . . . . 9 ⊢ ( + = · → ( + Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → (𝑉 × 𝑉) = (𝐾 × 𝑉))))
12	11	com13 80	. . . . . . . 8 ⊢ ( · Fn (𝐾 × 𝑉) → ( + Fn (𝑉 × 𝑉) → ( + = · → (𝑉 × 𝑉) = (𝐾 × 𝑉))))
13	12	impcom 125	. . . . . . 7 ⊢ (( + Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → ( + = · → (𝑉 × 𝑉) = (𝐾 × 𝑉)))
14		lmodgrp 14630	. . . . . . . . . . 11 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp)
15		eqid 2238	. . . . . . . . . . . 12 ⊢ (0g‘𝑊) = (0g‘𝑊)
16	1, 15	grpidcl 13834	. . . . . . . . . . 11 ⊢ (𝑊 ∈ Grp → (0g‘𝑊) ∈ 𝑉)
17		elex2 2838	. . . . . . . . . . 11 ⊢ ((0g‘𝑊) ∈ 𝑉 → ∃𝑤 𝑤 ∈ 𝑉)
18	14, 16, 17	3syl 17	. . . . . . . . . 10 ⊢ (𝑊 ∈ LMod → ∃𝑤 𝑤 ∈ 𝑉)
19		xp11m 5226	. . . . . . . . . 10 ⊢ ((∃𝑤 𝑤 ∈ 𝑉 ∧ ∃𝑤 𝑤 ∈ 𝑉) → ((𝑉 × 𝑉) = (𝐾 × 𝑉) ↔ (𝑉 = 𝐾 ∧ 𝑉 = 𝑉)))
20	18, 18, 19	syl2anc 415	. . . . . . . . 9 ⊢ (𝑊 ∈ LMod → ((𝑉 × 𝑉) = (𝐾 × 𝑉) ↔ (𝑉 = 𝐾 ∧ 𝑉 = 𝑉)))
21	20	simprbda 383	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ (𝑉 × 𝑉) = (𝐾 × 𝑉)) → 𝑉 = 𝐾)
22	21	expcom 116	. . . . . . 7 ⊢ ((𝑉 × 𝑉) = (𝐾 × 𝑉) → (𝑊 ∈ LMod → 𝑉 = 𝐾))
23	13, 22	syl6 33	. . . . . 6 ⊢ (( + Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → ( + = · → (𝑊 ∈ LMod → 𝑉 = 𝐾)))
24	23	com23 78	. . . . 5 ⊢ (( + Fn (𝑉 × 𝑉) ∧ · Fn (𝐾 × 𝑉)) → (𝑊 ∈ LMod → ( + = · → 𝑉 = 𝐾)))
25	24	ex 115	. . . 4 ⊢ ( + Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → (𝑊 ∈ LMod → ( + = · → 𝑉 = 𝐾))))
26	25	com3r 79	. . 3 ⊢ (𝑊 ∈ LMod → ( + Fn (𝑉 × 𝑉) → ( · Fn (𝐾 × 𝑉) → ( + = · → 𝑉 = 𝐾))))
27	3, 7, 26	mp2d 47	. 2 ⊢ (𝑊 ∈ LMod → ( + = · → 𝑉 = 𝐾))
28	27	imp 124	1 ⊢ ((𝑊 ∈ LMod ∧ + = · ) → 𝑉 = 𝐾)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃wex 1545   ∈ wcel 2209   × cxp 4772   Fn wfn 5372  ‘cfv 5377  Basecbs 13352  Scalarcsca 13434  0_gc0g 13610  +_𝑓cplusf 13673  Grpcgrp 13805  LModclmod 14623   ·_sf cscaf 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