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 38895

Description: Lemmma for mapdh6N 38898. 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 3948	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
8		mapdh6i.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
9	8	eldifad 3948	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
10	1, 2, 3, 4, 5, 7, 9	dvh3dim 38597	. 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 1129	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
21		mapdhc.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
22	21	3ad2ant1 1129	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝐹 ∈ 𝐷)
23		mapdh.mn	. . . . 5 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
24	23	3ad2ant1 1129	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
25	6	3ad2ant1 1129	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑋 ∈ (𝑉 ∖ { 0 }))
26		mapdh.p	. . . 4 ⊢ + = (+_g‘𝑈)
27		mapdh.a	. . . 4 ⊢ ✚ = (+_g‘𝐶)
28		mapdh6i.xn	. . . . 5 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
29	28	3ad2ant1 1129	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
30		mapdh6i.yz	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))
31	30	3ad2ant1 1129	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))
32	8	3ad2ant1 1129	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑌 ∈ (𝑉 ∖ { 0 }))
33		mapdh6i.z	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
34	33	3ad2ant1 1129	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑍 ∈ (𝑉 ∖ { 0 }))
35		eqid 2821	. . . . 5 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
36	1, 2, 5	dvhlmod 38261	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ LMod)
37	36	3ad2ant1 1129	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑈 ∈ LMod)
38	3, 35, 4, 36, 7, 9	lspprcl 19750	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ∈ (LSubSp‘𝑈))
39	38	3ad2ant1 1129	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝑁‘{𝑋, 𝑌}) ∈ (LSubSp‘𝑈))
40		simp2 1133	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → 𝑤 ∈ 𝑉)
41		simp3 1134	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))
42	15, 35, 37, 39, 40, 41	lssneln0 19724	. . . 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 38894	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑉 ∧ ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
44	43	rexlimdv3a 3286	. 2 ⊢ (𝜑 → (∃𝑤 ∈ 𝑉 ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}) → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩))))
45	10, 44	mpd 15	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∃wrex 3139 Vcvv 3494 ∖ cdif 3933 ifcif 4467 {csn 4567 {cpr 4569 ⟨cotp 4575 ↦ cmpt 5146 ‘cfv 6355 ℩crio 7113 (class class class)co 7156 1^st c1st 7687 2^nd c2nd 7688 Basecbs 16483 +_gcplusg 16565 0_gc0g 16713 -_gcsg 18105 LModclmod 19634 LSubSpclss 19703 LSpanclspn 19743 HLchlt 36501 LHypclh 37135 DVecHcdvh 38229 LCDualclcd 38737 mapdcmpd 38775

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-riotaBAD 36104

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-ot 4576 df-uni 4839 df-int 4877 df-iun 4921 df-iin 4922 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-of 7409 df-om 7581 df-1st 7689 df-2nd 7690 df-tpos 7892 df-undef 7939 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-map 8408 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-n0 11899 df-z 11983 df-uz 12245 df-fz 12894 df-struct 16485 df-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-ress 16491 df-plusg 16578 df-mulr 16579 df-sca 16581 df-vsca 16582 df-0g 16715 df-mre 16857 df-mrc 16858 df-acs 16860 df-proset 17538 df-poset 17556 df-plt 17568 df-lub 17584 df-glb 17585 df-join 17586 df-meet 17587 df-p0 17649 df-p1 17650 df-lat 17656 df-clat 17718 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-submnd 17957 df-grp 18106 df-minusg 18107 df-sbg 18108 df-subg 18276 df-cntz 18447 df-oppg 18474 df-lsm 18761 df-cmn 18908 df-abl 18909 df-mgp 19240 df-ur 19252 df-ring 19299 df-oppr 19373 df-dvdsr 19391 df-unit 19392 df-invr 19422 df-dvr 19433 df-drng 19504 df-lmod 19636 df-lss 19704 df-lsp 19744 df-lvec 19875 df-lsatoms 36127 df-lshyp 36128 df-lcv 36170 df-lfl 36209 df-lkr 36237 df-ldual 36275 df-oposet 36327 df-ol 36329 df-oml 36330 df-covers 36417 df-ats 36418 df-atl 36449 df-cvlat 36473 df-hlat 36502 df-llines 36649 df-lplanes 36650 df-lvols 36651 df-lines 36652 df-psubsp 36654 df-pmap 36655 df-padd 36947 df-lhyp 37139 df-laut 37140 df-ldil 37255 df-ltrn 37256 df-trl 37310 df-tgrp 37894 df-tendo 37906 df-edring 37908 df-dveca 38154 df-disoa 38180 df-dvech 38230 df-dib 38290 df-dic 38324 df-dih 38380 df-doch 38499 df-djh 38546 df-lcdual 38738 df-mapd 38776

This theorem is referenced by: mapdh6jN 38896

W3C validator