mapdh6iN - Mathbox for Norm Megill

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

Theorem mapdh6iN 37535

Description: Lemmma for mapdh6N 37538. Eliminate auxiliary vector 𝑤. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
mapdh.q	⊢ 𝑄 = (0_g‘𝐶)
mapdh.i	⊢ 𝐼 = (𝑥 ∈ V ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))
mapdh.h	⊢ 𝐻 = (LHyp‘𝐾)
mapdh.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
mapdh.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
mapdh.v	⊢ 𝑉 = (Base‘𝑈)
mapdh.s	⊢ − = (-_g‘𝑈)
mapdhc.o	⊢ 0 = (0_g‘𝑈)
mapdh.n	⊢ 𝑁 = (LSpan‘𝑈)
mapdh.c	⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
mapdh.d	⊢ 𝐷 = (Base‘𝐶)
mapdh.r	⊢ 𝑅 = (-_g‘𝐶)
mapdh.j	⊢ 𝐽 = (LSpan‘𝐶)
mapdh.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
mapdhc.f	⊢ (𝜑 → 𝐹 ∈ 𝐷)
mapdh.mn	⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
mapdhcl.x	⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
mapdh.p	⊢ + = (+_g‘𝑈)
mapdh.a	⊢ ✚ = (+_g‘𝐶)
mapdh6i.xn	⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
mapdh6i.y	⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
mapdh6i.z	⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
mapdh6i.yz	⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))

**Assertion**
Ref	Expression
mapdh6iN	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))

Distinct variable groups: 𝑥,𝐷,ℎ ℎ,𝐹,𝑥 𝑥,𝐽 𝑥,𝑀 𝑥,𝑁 𝑥, 0 𝑥,𝑄 𝑥,𝑅 𝑥, − ℎ,𝑋,𝑥 ℎ,𝑌,𝑥 𝜑,ℎ 0 ,ℎ 𝐶,ℎ 𝐷,ℎ ℎ,𝐽 ℎ,𝑀 ℎ,𝑁 𝑅,ℎ 𝑈,ℎ − ,ℎ ℎ,𝑍,𝑥 ✚ ,ℎ ℎ,𝐼,𝑥 + ,ℎ,𝑥 ℎ,𝑉 Allowed substitution hints: 𝜑(𝑥) 𝐶(𝑥) ✚ (𝑥) 𝑄(ℎ) 𝑈(𝑥) 𝐻(𝑥,ℎ) 𝐾(𝑥,ℎ) 𝑉(𝑥) 𝑊(𝑥,ℎ)

Proof of Theorem mapdh6iN Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mapdh.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
2		mapdh.u	. . 3 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
3		mapdh.v	. . 3 ⊢ 𝑉 = (Base‘𝑈)
4		mapdh.n	. . 3 ⊢ 𝑁 = (LSpan‘𝑈)
5		mapdh.k	. . 3 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6		mapdhcl.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
7	6	eldifad 3727	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
8		mapdh6i.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
9	8	eldifad 3727	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
10	1, 2, 3, 4, 5, 7, 9	dvh3dim 37237	. 2 ⊢ (𝜑 → ∃𝑤 ∈ 𝑉 ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))
11		mapdh.q	. . . 4 ⊢ 𝑄 = (0_g‘𝐶)
12		mapdh.i	. . . 4 ⊢ 𝐼 = (𝑥 ∈ V ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))
13		mapdh.m	. . . 4 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
14		mapdh.s	. . . 4 ⊢ − = (-_g‘𝑈)
15		mapdhc.o	. . . 4 ⊢ 0 = (0_g‘𝑈)
16		mapdh.c	. . . 4 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
17		mapdh.d	. . . 4 ⊢ 𝐷 = (Base‘𝐶)
18		mapdh.r	. . . 4 ⊢ 𝑅 = (-_g‘𝐶)
19		mapdh.j	. . . 4 ⊢ 𝐽 = (LSpan‘𝐶)
20	5	3ad2ant1 1128	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
21		mapdhc.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
22	21	3ad2ant1 1128	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝐹 ∈ 𝐷)
23		mapdh.mn	. . . . 5 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
24	23	3ad2ant1 1128	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
25	6	3ad2ant1 1128	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑋 ∈ (𝑉 ∖ { 0 }))
26		mapdh.p	. . . 4 ⊢ + = (+_g‘𝑈)
27		mapdh.a	. . . 4 ⊢ ✚ = (+_g‘𝐶)
28		mapdh6i.xn	. . . . 5 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
29	28	3ad2ant1 1128	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
30		mapdh6i.yz	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))
31	30	3ad2ant1 1128	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))
32	8	3ad2ant1 1128	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑌 ∈ (𝑉 ∖ { 0 }))
33		mapdh6i.z	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
34	33	3ad2ant1 1128	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑍 ∈ (𝑉 ∖ { 0 }))
35		eqid 2760	. . . . 5 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
36	1, 2, 5	dvhlmod 36901	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ LMod)
37	36	3ad2ant1 1128	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑈 ∈ LMod)
38	3, 35, 4, 36, 7, 9	lspprcl 19180	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ∈ (LSubSp‘𝑈))
39	38	3ad2ant1 1128	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝑁‘{𝑋, 𝑌}) ∈ (LSubSp‘𝑈))
40		simp2 1132	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑤 ∈ 𝑉)
41		simp3 1133	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))
42	3, 15, 35, 37, 39, 40, 41	lssneln0 19154	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑤 ∈ (𝑉 ∖ { 0 }))
43	11, 12, 1, 13, 2, 3, 14, 15, 4, 16, 17, 18, 19, 20, 22, 24, 25, 26, 27, 29, 31, 32, 34, 42, 41	mapdh6hN 37534	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
44	43	rexlimdv3a 3171	. 2 ⊢ (𝜑 → (∃𝑤 ∈ 𝑉 ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}) → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩))))
45	10, 44	mpd 15	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 ∧ w3a 1072 = wceq 1632 ∈ wcel 2139 ∃wrex 3051 Vcvv 3340 ∖ cdif 3712 ifcif 4230 {csn 4321 {cpr 4323 ⟨cotp 4329 ↦ cmpt 4881 ‘cfv 6049 ℩crio 6773 (class class class)co 6813 1^st c1st 7331 2^nd c2nd 7332 Basecbs 16059 +_gcplusg 16143 0_gc0g 16302 -_gcsg 17625 LModclmod 19065 LSubSpclss 19134 LSpanclspn 19173 HLchlt 35140 LHypclh 35773 DVecHcdvh 36869 LCDualclcd 37377 mapdcmpd 37415

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-rep 4923 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7114 ax-cnex 10184 ax-resscn 10185 ax-1cn 10186 ax-icn 10187 ax-addcl 10188 ax-addrcl 10189 ax-mulcl 10190 ax-mulrcl 10191 ax-mulcom 10192 ax-addass 10193 ax-mulass 10194 ax-distr 10195 ax-i2m1 10196 ax-1ne0 10197 ax-1rid 10198 ax-rnegex 10199 ax-rrecex 10200 ax-cnre 10201 ax-pre-lttri 10202 ax-pre-lttrn 10203 ax-pre-ltadd 10204 ax-pre-mulgt0 10205 ax-riotaBAD 34742

This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-fal 1638 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-ot 4330 df-uni 4589 df-int 4628 df-iun 4674 df-iin 4675 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6774 df-ov 6816 df-oprab 6817 df-mpt2 6818 df-of 7062 df-om 7231 df-1st 7333 df-2nd 7334 df-tpos 7521 df-undef 7568 df-wrecs 7576 df-recs 7637 df-rdg 7675 df-1o 7729 df-oadd 7733 df-er 7911 df-map 8025 df-en 8122 df-dom 8123 df-sdom 8124 df-fin 8125 df-pnf 10268 df-mnf 10269 df-xr 10270 df-ltxr 10271 df-le 10272 df-sub 10460 df-neg 10461 df-nn 11213 df-2 11271 df-3 11272 df-4 11273 df-5 11274 df-6 11275 df-n0 11485 df-z 11570 df-uz 11880 df-fz 12520 df-struct 16061 df-ndx 16062 df-slot 16063 df-base 16065 df-sets 16066 df-ress 16067 df-plusg 16156 df-mulr 16157 df-sca 16159 df-vsca 16160 df-0g 16304 df-mre 16448 df-mrc 16449 df-acs 16451 df-preset 17129 df-poset 17147 df-plt 17159 df-lub 17175 df-glb 17176 df-join 17177 df-meet 17178 df-p0 17240 df-p1 17241 df-lat 17247 df-clat 17309 df-mgm 17443 df-sgrp 17485 df-mnd 17496 df-submnd 17537 df-grp 17626 df-minusg 17627 df-sbg 17628 df-subg 17792 df-cntz 17950 df-oppg 17976 df-lsm 18251 df-cmn 18395 df-abl 18396 df-mgp 18690 df-ur 18702 df-ring 18749 df-oppr 18823 df-dvdsr 18841 df-unit 18842 df-invr 18872 df-dvr 18883 df-drng 18951 df-lmod 19067 df-lss 19135 df-lsp 19174 df-lvec 19305 df-lsatoms 34766 df-lshyp 34767 df-lcv 34809 df-lfl 34848 df-lkr 34876 df-ldual 34914 df-oposet 34966 df-ol 34968 df-oml 34969 df-covers 35056 df-ats 35057 df-atl 35088 df-cvlat 35112 df-hlat 35141 df-llines 35287 df-lplanes 35288 df-lvols 35289 df-lines 35290 df-psubsp 35292 df-pmap 35293 df-padd 35585 df-lhyp 35777 df-laut 35778 df-ldil 35893 df-ltrn 35894 df-trl 35949 df-tgrp 36533 df-tendo 36545 df-edring 36547 df-dveca 36793 df-disoa 36820 df-dvech 36870 df-dib 36930 df-dic 36964 df-dih 37020 df-doch 37139 df-djh 37186 df-lcdual 37378 df-mapd 37416

This theorem is referenced by: mapdh6jN 37536

W3C validator