Metamath Proof Explorer


Theorem mapdpglem19

Description: Lemma for mapdpg . Baer p. 45, line 8: "...is in (Fy)*..." (Contributed by NM, 20-Mar-2015)

Ref Expression
Hypotheses mapdpglem.h H = LHyp K
mapdpglem.m M = mapd K W
mapdpglem.u U = DVecH K W
mapdpglem.v V = Base U
mapdpglem.s - ˙ = - U
mapdpglem.n N = LSpan U
mapdpglem.c C = LCDual K W
mapdpglem.k φ K HL W H
mapdpglem.x φ X V
mapdpglem.y φ Y V
mapdpglem1.p ˙ = LSSum C
mapdpglem2.j J = LSpan C
mapdpglem3.f F = Base C
mapdpglem3.te φ t M N X ˙ M N Y
mapdpglem3.a A = Scalar U
mapdpglem3.b B = Base A
mapdpglem3.t · ˙ = C
mapdpglem3.r R = - C
mapdpglem3.g φ G F
mapdpglem3.e φ M N X = J G
mapdpglem4.q Q = 0 U
mapdpglem.ne φ N X N Y
mapdpglem4.jt φ M N X - ˙ Y = J t
mapdpglem4.z 0 ˙ = 0 A
mapdpglem4.g4 φ g B
mapdpglem4.z4 φ z M N Y
mapdpglem4.t4 φ t = g · ˙ G R z
mapdpglem4.xn φ X Q
mapdpglem12.yn φ Y Q
mapdpglem17.ep E = inv r A g · ˙ z
Assertion mapdpglem19 φ E M N Y

Proof

Step Hyp Ref Expression
1 mapdpglem.h H = LHyp K
2 mapdpglem.m M = mapd K W
3 mapdpglem.u U = DVecH K W
4 mapdpglem.v V = Base U
5 mapdpglem.s - ˙ = - U
6 mapdpglem.n N = LSpan U
7 mapdpglem.c C = LCDual K W
8 mapdpglem.k φ K HL W H
9 mapdpglem.x φ X V
10 mapdpglem.y φ Y V
11 mapdpglem1.p ˙ = LSSum C
12 mapdpglem2.j J = LSpan C
13 mapdpglem3.f F = Base C
14 mapdpglem3.te φ t M N X ˙ M N Y
15 mapdpglem3.a A = Scalar U
16 mapdpglem3.b B = Base A
17 mapdpglem3.t · ˙ = C
18 mapdpglem3.r R = - C
19 mapdpglem3.g φ G F
20 mapdpglem3.e φ M N X = J G
21 mapdpglem4.q Q = 0 U
22 mapdpglem.ne φ N X N Y
23 mapdpglem4.jt φ M N X - ˙ Y = J t
24 mapdpglem4.z 0 ˙ = 0 A
25 mapdpglem4.g4 φ g B
26 mapdpglem4.z4 φ z M N Y
27 mapdpglem4.t4 φ t = g · ˙ G R z
28 mapdpglem4.xn φ X Q
29 mapdpglem12.yn φ Y Q
30 mapdpglem17.ep E = inv r A g · ˙ z
31 eqid LSubSp C = LSubSp C
32 eqid LSubSp U = LSubSp U
33 1 3 8 dvhlmod φ U LMod
34 4 32 6 lspsncl U LMod Y V N Y LSubSp U
35 33 10 34 syl2anc φ N Y LSubSp U
36 1 2 3 32 7 31 8 35 mapdcl2 φ M N Y LSubSp C
37 1 3 8 dvhlvec φ U LVec
38 15 lvecdrng U LVec A DivRing
39 37 38 syl φ A DivRing
40 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 mapdpglem11 φ g 0 ˙
41 eqid inv r A = inv r A
42 16 24 41 drnginvrcl A DivRing g B g 0 ˙ inv r A g B
43 39 25 40 42 syl3anc φ inv r A g B
44 1 3 15 16 7 13 17 31 8 36 43 26 lcdlssvscl φ inv r A g · ˙ z M N Y
45 30 44 eqeltrid φ E M N Y