Metamath Proof Explorer


Theorem mapdpglem14

Description: Lemma for mapdpg . (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
mapdpglem12.g0 ⊢ φ → z = 0 C
Assertion mapdpglem14 ⊢ φ → Y ∈ N ⁡ X

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 mapdpglem12.g0 ⊢ φ → z = 0 C
31 1 3 8 dvhlmod ⊢ φ → U ∈ LMod
32 eqid ⊢ + U = + U
33 4 32 5 lmodvnpcan ⊢ U ∈ LMod ∧ Y ∈ V ∧ X ∈ V → Y - ˙ X + U X = Y
34 31 10 9 33 syl3anc ⊢ φ → Y - ˙ X + U X = Y
35 eqid ⊢ LSubSp ⁡ U = LSubSp ⁡ U
36 4 35 6 lspsncl ⊢ U ∈ LMod ∧ X ∈ V → N ⁡ X ∈ LSubSp ⁡ U
37 31 9 36 syl2anc ⊢ φ → N ⁡ X ∈ LSubSp ⁡ U
38 lmodgrp ⊢ U ∈ LMod → U ∈ Grp
39 31 38 syl ⊢ φ → U ∈ Grp
40 eqid ⊢ inv g ⁡ U = inv g ⁡ U
41 4 5 40 grpinvsub ⊢ U ∈ Grp ∧ X ∈ V ∧ Y ∈ V → inv g ⁡ U ⁡ X - ˙ Y = Y - ˙ X
42 39 9 10 41 syl3anc ⊢ φ → inv g ⁡ U ⁡ X - ˙ Y = Y - ˙ X
43 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 29 30 mapdpglem13 ⊢ φ → N ⁡ X - ˙ Y ⊆ N ⁡ X
44 4 5 lmodvsubcl ⊢ U ∈ LMod ∧ X ∈ V ∧ Y ∈ V → X - ˙ Y ∈ V
45 31 9 10 44 syl3anc ⊢ φ → X - ˙ Y ∈ V
46 4 6 lspsnid ⊢ U ∈ LMod ∧ X - ˙ Y ∈ V → X - ˙ Y ∈ N ⁡ X - ˙ Y
47 31 45 46 syl2anc ⊢ φ → X - ˙ Y ∈ N ⁡ X - ˙ Y
48 43 47 sseldd ⊢ φ → X - ˙ Y ∈ N ⁡ X
49 35 40 lssvnegcl ⊢ U ∈ LMod ∧ N ⁡ X ∈ LSubSp ⁡ U ∧ X - ˙ Y ∈ N ⁡ X → inv g ⁡ U ⁡ X - ˙ Y ∈ N ⁡ X
50 31 37 48 49 syl3anc ⊢ φ → inv g ⁡ U ⁡ X - ˙ Y ∈ N ⁡ X
51 42 50 eqeltrrd ⊢ φ → Y - ˙ X ∈ N ⁡ X
52 4 6 lspsnid ⊢ U ∈ LMod ∧ X ∈ V → X ∈ N ⁡ X
53 31 9 52 syl2anc ⊢ φ → X ∈ N ⁡ X
54 32 35 lssvacl ⊢ U ∈ LMod ∧ N ⁡ X ∈ LSubSp ⁡ U ∧ Y - ˙ X ∈ N ⁡ X ∧ X ∈ N ⁡ X → Y - ˙ X + U X ∈ N ⁡ X
55 31 37 51 53 54 syl22anc ⊢ φ → Y - ˙ X + U X ∈ N ⁡ X
56 34 55 eqeltrrd ⊢ φ → Y ∈ N ⁡ X