mapdpglem16 - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > mapdpglem16		Structured version Visualization version GIF version

Theorem mapdpglem16 41654

Description: Lemma for mapdpg 41673. Baer p. 45, line 7: "Likewise we see that z =/= 0." (Contributed by NM, 20-Mar-2015.)

**Hypotheses**
Ref	Expression
mapdpglem.h	⊢ 𝐻 = (LHyp‘𝐾)
mapdpglem.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
mapdpglem.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
mapdpglem.v	⊢ 𝑉 = (Base‘𝑈)
mapdpglem.s	⊢ − = (-_g‘𝑈)
mapdpglem.n	⊢ 𝑁 = (LSpan‘𝑈)
mapdpglem.c	⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
mapdpglem.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
mapdpglem.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
mapdpglem.y	⊢ (𝜑 → 𝑌 ∈ 𝑉)
mapdpglem1.p	⊢ ⊕ = (LSSum‘𝐶)
mapdpglem2.j	⊢ 𝐽 = (LSpan‘𝐶)
mapdpglem3.f	⊢ 𝐹 = (Base‘𝐶)
mapdpglem3.te	⊢ (𝜑 → 𝑡 ∈ ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌}))))
mapdpglem3.a	⊢ 𝐴 = (Scalar‘𝑈)
mapdpglem3.b	⊢ 𝐵 = (Base‘𝐴)
mapdpglem3.t	⊢ · = ( ·_𝑠 ‘𝐶)
mapdpglem3.r	⊢ 𝑅 = (-_g‘𝐶)
mapdpglem3.g	⊢ (𝜑 → 𝐺 ∈ 𝐹)
mapdpglem3.e	⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))
mapdpglem4.q	⊢ 𝑄 = (0_g‘𝑈)
mapdpglem.ne	⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
mapdpglem4.jt	⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{𝑡}))
mapdpglem4.z	⊢ 0 = (0_g‘𝐴)
mapdpglem4.g4	⊢ (𝜑 → 𝑔 ∈ 𝐵)
mapdpglem4.z4	⊢ (𝜑 → 𝑧 ∈ (𝑀‘(𝑁‘{𝑌})))
mapdpglem4.t4	⊢ (𝜑 → 𝑡 = ((𝑔 · 𝐺)𝑅𝑧))
mapdpglem4.xn	⊢ (𝜑 → 𝑋 ≠ 𝑄)
mapdpglem12.yn	⊢ (𝜑 → 𝑌 ≠ 𝑄)

**Assertion**
Ref	Expression
mapdpglem16	⊢ (𝜑 → 𝑧 ≠ (0_g‘𝐶))

Distinct variable groups: 𝑡, − 𝑡,𝐶 𝑡,𝐽 𝑡,𝑀 𝑡,𝑁 𝑡,𝑋 𝑡,𝑌 𝐵,𝑔 𝑧,𝑔,𝐶 𝑔,𝐹 𝑔,𝐺,𝑧 𝑔,𝐽,𝑧 𝑔,𝑀,𝑧 𝑔,𝑁,𝑧 𝑅,𝑔,𝑧 · ,𝑔,𝑧 𝑔,𝑌,𝑧,𝑡 Allowed substitution hints: 𝜑(𝑧,𝑡,𝑔) 𝐴(𝑧,𝑡,𝑔) 𝐵(𝑧,𝑡) ⊕ (𝑧,𝑡,𝑔) 𝑄(𝑧,𝑡,𝑔) 𝑅(𝑡) · (𝑡) 𝑈(𝑧,𝑡,𝑔) 𝐹(𝑧,𝑡) 𝐺(𝑡) 𝐻(𝑧,𝑡,𝑔) 𝐾(𝑧,𝑡,𝑔) − (𝑧,𝑔) 𝑉(𝑧,𝑡,𝑔) 𝑊(𝑧,𝑡,𝑔) 𝑋(𝑧,𝑔) 0 (𝑧,𝑡,𝑔)

**Proof of Theorem mapdpglem16**
Step	Hyp	Ref	Expression
1		mapdpglem.ne	. 2 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
2		mapdpglem.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
3		mapdpglem.m	. . . . 5 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
4		mapdpglem.u	. . . . 5 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
5		mapdpglem.v	. . . . 5 ⊢ 𝑉 = (Base‘𝑈)
6		mapdpglem.s	. . . . 5 ⊢ − = (-_g‘𝑈)
7		mapdpglem.n	. . . . 5 ⊢ 𝑁 = (LSpan‘𝑈)
8		mapdpglem.c	. . . . 5 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
9		mapdpglem.k	. . . . . 6 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
10	9	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
11		mapdpglem.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝑋 ∈ 𝑉)
13		mapdpglem.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
14	13	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝑌 ∈ 𝑉)
15		mapdpglem1.p	. . . . 5 ⊢ ⊕ = (LSSum‘𝐶)
16		mapdpglem2.j	. . . . 5 ⊢ 𝐽 = (LSpan‘𝐶)
17		mapdpglem3.f	. . . . 5 ⊢ 𝐹 = (Base‘𝐶)
18		mapdpglem3.te	. . . . . 6 ⊢ (𝜑 → 𝑡 ∈ ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌}))))
19	18	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝑡 ∈ ((𝑀‘(𝑁‘{𝑋})) ⊕ (𝑀‘(𝑁‘{𝑌}))))
20		mapdpglem3.a	. . . . 5 ⊢ 𝐴 = (Scalar‘𝑈)
21		mapdpglem3.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐴)
22		mapdpglem3.t	. . . . 5 ⊢ · = ( ·_𝑠 ‘𝐶)
23		mapdpglem3.r	. . . . 5 ⊢ 𝑅 = (-_g‘𝐶)
24		mapdpglem3.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
25	24	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝐺 ∈ 𝐹)
26		mapdpglem3.e	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))
27	26	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))
28		mapdpglem4.q	. . . . 5 ⊢ 𝑄 = (0_g‘𝑈)
29	1	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
30		mapdpglem4.jt	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{𝑡}))
31	30	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{𝑡}))
32		mapdpglem4.z	. . . . 5 ⊢ 0 = (0_g‘𝐴)
33		mapdpglem4.g4	. . . . . 6 ⊢ (𝜑 → 𝑔 ∈ 𝐵)
34	33	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝑔 ∈ 𝐵)
35		mapdpglem4.z4	. . . . . 6 ⊢ (𝜑 → 𝑧 ∈ (𝑀‘(𝑁‘{𝑌})))
36	35	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝑧 ∈ (𝑀‘(𝑁‘{𝑌})))
37		mapdpglem4.t4	. . . . . 6 ⊢ (𝜑 → 𝑡 = ((𝑔 · 𝐺)𝑅𝑧))
38	37	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝑡 = ((𝑔 · 𝐺)𝑅𝑧))
39		mapdpglem4.xn	. . . . . 6 ⊢ (𝜑 → 𝑋 ≠ 𝑄)
40	39	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝑋 ≠ 𝑄)
41		mapdpglem12.yn	. . . . . 6 ⊢ (𝜑 → 𝑌 ≠ 𝑄)
42	41	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝑌 ≠ 𝑄)
43		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → 𝑧 = (0_g‘𝐶))
44	2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 19, 20, 21, 22, 23, 25, 27, 28, 29, 31, 32, 34, 36, 38, 40, 42, 43	mapdpglem15 41653	. . . 4 ⊢ ((𝜑 ∧ 𝑧 = (0_g‘𝐶)) → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))
45	44	ex 412	. . 3 ⊢ (𝜑 → (𝑧 = (0_g‘𝐶) → (𝑁‘{𝑋}) = (𝑁‘{𝑌})))
46	45	necon3d 2946	. 2 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) → 𝑧 ≠ (0_g‘𝐶)))
47	1, 46	mpd 15	1 ⊢ (𝜑 → 𝑧 ≠ (0_g‘𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 {csn 4585 ‘cfv 6499 (class class class)co 7369 Basecbs 17155 Scalarcsca 17199 ·_𝑠 cvsca 17200 0_gc0g 17378 -_gcsg 18843 LSSumclsm 19540 LSpanclspn 20853 HLchlt 39316 LHypclh 39951 DVecHcdvh 41045 LCDualclcd 41553 mapdcmpd 41591

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-riotaBAD 38919

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-of 7633 df-om 7823 df-1st 7947 df-2nd 7948 df-tpos 8182 df-undef 8229 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-2o 8412 df-er 8648 df-map 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-n0 12419 df-z 12506 df-uz 12770 df-fz 13445 df-struct 17093 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-mulr 17210 df-sca 17212 df-vsca 17213 df-0g 17380 df-mre 17523 df-mrc 17524 df-acs 17526 df-proset 18231 df-poset 18250 df-plt 18265 df-lub 18281 df-glb 18282 df-join 18283 df-meet 18284 df-p0 18360 df-p1 18361 df-lat 18367 df-clat 18434 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-submnd 18687 df-grp 18844 df-minusg 18845 df-sbg 18846 df-subg 19031 df-cntz 19225 df-oppg 19254 df-lsm 19542 df-cmn 19688 df-abl 19689 df-mgp 20026 df-rng 20038 df-ur 20067 df-ring 20120 df-oppr 20222 df-dvdsr 20242 df-unit 20243 df-invr 20273 df-dvr 20286 df-nzr 20398 df-rlreg 20579 df-domn 20580 df-drng 20616 df-lmod 20744 df-lss 20814 df-lsp 20854 df-lvec 20986 df-lsatoms 38942 df-lshyp 38943 df-lcv 38985 df-lfl 39024 df-lkr 39052 df-ldual 39090 df-oposet 39142 df-ol 39144 df-oml 39145 df-covers 39232 df-ats 39233 df-atl 39264 df-cvlat 39288 df-hlat 39317 df-llines 39465 df-lplanes 39466 df-lvols 39467 df-lines 39468 df-psubsp 39470 df-pmap 39471 df-padd 39763 df-lhyp 39955 df-laut 39956 df-ldil 40071 df-ltrn 40072 df-trl 40126 df-tgrp 40710 df-tendo 40722 df-edring 40724 df-dveca 40970 df-disoa 40996 df-dvech 41046 df-dib 41106 df-dic 41140 df-dih 41196 df-doch 41315 df-djh 41362 df-lcdual 41554 df-mapd 41592

This theorem is referenced by: mapdpglem18 41656

W3C validator