mapdh6cN - Mathbox for Norm Megill

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

Theorem mapdh6cN 41721

Description: Lemmma for mapdh6N 41730. (Contributed by NM, 24-Apr-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‘𝐶)
mapdh6c.y	⊢ (𝜑 → 𝑌 ∈ 𝑉)
mapdh6c.z	⊢ (𝜑 → 𝑍 = 0 )
mapdh6c.ne	⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))

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

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

**Proof of Theorem mapdh6cN**
Step	Hyp	Ref	Expression
1		mapdh.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
2		mapdh.c	. . . . 5 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
3		mapdh.k	. . . . 5 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
4	1, 2, 3	lcdlmod 41575	. . . 4 ⊢ (𝜑 → 𝐶 ∈ LMod)
5		lmodgrp 20770	. . . 4 ⊢ (𝐶 ∈ LMod → 𝐶 ∈ Grp)
6	4, 5	syl 17	. . 3 ⊢ (𝜑 → 𝐶 ∈ Grp)
7		mapdh.q	. . . 4 ⊢ 𝑄 = (0_g‘𝐶)
8		mapdh.i	. . . 4 ⊢ 𝐼 = (𝑥 ∈ V ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))
9		mapdh.m	. . . 4 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
10		mapdh.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
11		mapdh.v	. . . 4 ⊢ 𝑉 = (Base‘𝑈)
12		mapdh.s	. . . 4 ⊢ − = (-_g‘𝑈)
13		mapdhc.o	. . . 4 ⊢ 0 = (0_g‘𝑈)
14		mapdh.n	. . . 4 ⊢ 𝑁 = (LSpan‘𝑈)
15		mapdh.d	. . . 4 ⊢ 𝐷 = (Base‘𝐶)
16		mapdh.r	. . . 4 ⊢ 𝑅 = (-_g‘𝐶)
17		mapdh.j	. . . 4 ⊢ 𝐽 = (LSpan‘𝐶)
18		mapdhc.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
19		mapdh.mn	. . . 4 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
20		mapdhcl.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
21		mapdh6c.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
22	1, 10, 3	dvhlvec 41092	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ LVec)
23	20	eldifad 3915	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
24		mapdh6c.z	. . . . . . 7 ⊢ (𝜑 → 𝑍 = 0 )
25	1, 10, 3	dvhlmod 41093	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod)
26	11, 13	lmod0vcl 20794	. . . . . . . 8 ⊢ (𝑈 ∈ LMod → 0 ∈ 𝑉)
27	25, 26	syl 17	. . . . . . 7 ⊢ (𝜑 → 0 ∈ 𝑉)
28	24, 27	eqeltrd 2828	. . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
29		mapdh6c.ne	. . . . . 6 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
30	11, 14, 22, 23, 21, 28, 29	lspindpi 21039	. . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) ∧ (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍})))
31	30	simpld 494	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
32	7, 8, 1, 9, 10, 11, 12, 13, 14, 2, 15, 16, 17, 3, 18, 19, 20, 21, 31	mapdhcl 41710	. . 3 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷)
33		mapdh.a	. . . 4 ⊢ ✚ = (+_g‘𝐶)
34	15, 33, 7	grprid 18847	. . 3 ⊢ ((𝐶 ∈ Grp ∧ (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷) → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ 𝑄) = (𝐼‘⟨𝑋, 𝐹, 𝑌⟩))
35	6, 32, 34	syl2anc 584	. 2 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ 𝑄) = (𝐼‘⟨𝑋, 𝐹, 𝑌⟩))
36	24	oteq3d 4838	. . . . 5 ⊢ (𝜑 → ⟨𝑋, 𝐹, 𝑍⟩ = ⟨𝑋, 𝐹, 0 ⟩)
37	36	fveq2d 6826	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = (𝐼‘⟨𝑋, 𝐹, 0 ⟩))
38	7, 8, 13, 20, 18	mapdhval0 41708	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 0 ⟩) = 𝑄)
39	37, 38	eqtrd 2764	. . 3 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝑄)
40	39	oveq2d 7365	. 2 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ 𝑄))
41	24	oveq2d 7365	. . . . 5 ⊢ (𝜑 → (𝑌 + 𝑍) = (𝑌 + 0 ))
42		lmodgrp 20770	. . . . . . 7 ⊢ (𝑈 ∈ LMod → 𝑈 ∈ Grp)
43	25, 42	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ Grp)
44		mapdh.p	. . . . . . 7 ⊢ + = (+_g‘𝑈)
45	11, 44, 13	grprid 18847	. . . . . 6 ⊢ ((𝑈 ∈ Grp ∧ 𝑌 ∈ 𝑉) → (𝑌 + 0 ) = 𝑌)
46	43, 21, 45	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑌 + 0 ) = 𝑌)
47	41, 46	eqtrd 2764	. . . 4 ⊢ (𝜑 → (𝑌 + 𝑍) = 𝑌)
48	47	oteq3d 4838	. . 3 ⊢ (𝜑 → ⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩ = ⟨𝑋, 𝐹, 𝑌⟩)
49	48	fveq2d 6826	. 2 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑌⟩))
50	35, 40, 49	3eqtr4rd 2775	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 Vcvv 3436 ∖ cdif 3900 ifcif 4476 {csn 4577 {cpr 4579 ⟨cotp 4585 ↦ cmpt 5173 ‘cfv 6482 ℩crio 7305 (class class class)co 7349 1^st c1st 7922 2^nd c2nd 7923 Basecbs 17120 +_gcplusg 17161 0_gc0g 17343 Grpcgrp 18812 -_gcsg 18814 LModclmod 20763 LSpanclspn 20874 HLchlt 39333 LHypclh 39967 DVecHcdvh 41061 LCDualclcd 41569 mapdcmpd 41607

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 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 ax-riotaBAD 38936

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 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-tp 4582 df-op 4584 df-ot 4586 df-uni 4859 df-int 4897 df-iun 4943 df-iin 4944 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-of 7613 df-om 7800 df-1st 7924 df-2nd 7925 df-tpos 8159 df-undef 8206 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-1o 8388 df-2o 8389 df-er 8625 df-map 8755 df-en 8873 df-dom 8874 df-sdom 8875 df-fin 8876 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-nn 12129 df-2 12191 df-3 12192 df-4 12193 df-5 12194 df-6 12195 df-n0 12385 df-z 12472 df-uz 12736 df-fz 13411 df-struct 17058 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-mulr 17175 df-sca 17177 df-vsca 17178 df-0g 17345 df-mre 17488 df-mrc 17489 df-acs 17491 df-proset 18200 df-poset 18219 df-plt 18234 df-lub 18250 df-glb 18251 df-join 18252 df-meet 18253 df-p0 18329 df-p1 18330 df-lat 18338 df-clat 18405 df-mgm 18514 df-sgrp 18593 df-mnd 18609 df-submnd 18658 df-grp 18815 df-minusg 18816 df-sbg 18817 df-subg 19002 df-cntz 19196 df-oppg 19225 df-lsm 19515 df-cmn 19661 df-abl 19662 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 20765 df-lss 20835 df-lsp 20875 df-lvec 21007 df-lsatoms 38959 df-lshyp 38960 df-lcv 39002 df-lfl 39041 df-lkr 39069 df-ldual 39107 df-oposet 39159 df-ol 39161 df-oml 39162 df-covers 39249 df-ats 39250 df-atl 39281 df-cvlat 39305 df-hlat 39334 df-llines 39481 df-lplanes 39482 df-lvols 39483 df-lines 39484 df-psubsp 39486 df-pmap 39487 df-padd 39779 df-lhyp 39971 df-laut 39972 df-ldil 40087 df-ltrn 40088 df-trl 40142 df-tgrp 40726 df-tendo 40738 df-edring 40740 df-dveca 40986 df-disoa 41012 df-dvech 41062 df-dib 41122 df-dic 41156 df-dih 41212 df-doch 41331 df-djh 41378 df-lcdual 41570 df-mapd 41608

This theorem is referenced by: mapdh6kN 41729

W3C validator