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 41695

Description: Lemmma for mapdh6N 41704. (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 41549	. . . 4 ⊢ (𝜑 → 𝐶 ∈ LMod)
5		lmodgrp 20887	. . . 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 41066	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ LVec)
23	20	eldifad 3988	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
24		mapdh6c.z	. . . . . . 7 ⊢ (𝜑 → 𝑍 = 0 )
25	1, 10, 3	dvhlmod 41067	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ LMod)
26	11, 13	lmod0vcl 20911	. . . . . . . 8 ⊢ (𝑈 ∈ LMod → 0 ∈ 𝑉)
27	25, 26	syl 17	. . . . . . 7 ⊢ (𝜑 → 0 ∈ 𝑉)
28	24, 27	eqeltrd 2844	. . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
29		mapdh6c.ne	. . . . . 6 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
30	11, 14, 22, 23, 21, 28, 29	lspindpi 21157	. . . . 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 41684	. . 3 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷)
33		mapdh.a	. . . 4 ⊢ ✚ = (+_g‘𝐶)
34	15, 33, 7	grprid 19008	. . 3 ⊢ ((𝐶 ∈ Grp ∧ (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷) → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ 𝑄) = (𝐼‘⟨𝑋, 𝐹, 𝑌⟩))
35	6, 32, 34	syl2anc 583	. 2 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ 𝑄) = (𝐼‘⟨𝑋, 𝐹, 𝑌⟩))
36	24	oteq3d 4911	. . . . 5 ⊢ (𝜑 → ⟨𝑋, 𝐹, 𝑍⟩ = ⟨𝑋, 𝐹, 0 ⟩)
37	36	fveq2d 6924	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = (𝐼‘⟨𝑋, 𝐹, 0 ⟩))
38	7, 8, 13, 20, 18	mapdhval0 41682	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 0 ⟩) = 𝑄)
39	37, 38	eqtrd 2780	. . 3 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝑄)
40	39	oveq2d 7464	. 2 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ 𝑄))
41	24	oveq2d 7464	. . . . 5 ⊢ (𝜑 → (𝑌 + 𝑍) = (𝑌 + 0 ))
42		lmodgrp 20887	. . . . . . 7 ⊢ (𝑈 ∈ LMod → 𝑈 ∈ Grp)
43	25, 42	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ Grp)
44		mapdh.p	. . . . . . 7 ⊢ + = (+_g‘𝑈)
45	11, 44, 13	grprid 19008	. . . . . 6 ⊢ ((𝑈 ∈ Grp ∧ 𝑌 ∈ 𝑉) → (𝑌 + 0 ) = 𝑌)
46	43, 21, 45	syl2anc 583	. . . . 5 ⊢ (𝜑 → (𝑌 + 0 ) = 𝑌)
47	41, 46	eqtrd 2780	. . . 4 ⊢ (𝜑 → (𝑌 + 𝑍) = 𝑌)
48	47	oteq3d 4911	. . 3 ⊢ (𝜑 → ⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩ = ⟨𝑋, 𝐹, 𝑌⟩)
49	48	fveq2d 6924	. 2 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑌⟩))
50	35, 40, 49	3eqtr4rd 2791	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 Vcvv 3488 ∖ cdif 3973 ifcif 4548 {csn 4648 {cpr 4650 ⟨cotp 4656 ↦ cmpt 5249 ‘cfv 6573 ℩crio 7403 (class class class)co 7448 1^st c1st 8028 2^nd c2nd 8029 Basecbs 17258 +_gcplusg 17311 0_gc0g 17499 Grpcgrp 18973 -_gcsg 18975 LModclmod 20880 LSpanclspn 20992 HLchlt 39306 LHypclh 39941 DVecHcdvh 41035 LCDualclcd 41543 mapdcmpd 41581

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-riotaBAD 38909

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-ot 4657 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-of 7714 df-om 7904 df-1st 8030 df-2nd 8031 df-tpos 8267 df-undef 8314 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-er 8763 df-map 8886 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-n0 12554 df-z 12640 df-uz 12904 df-fz 13568 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-mulr 17325 df-sca 17327 df-vsca 17328 df-0g 17501 df-mre 17644 df-mrc 17645 df-acs 17647 df-proset 18365 df-poset 18383 df-plt 18400 df-lub 18416 df-glb 18417 df-join 18418 df-meet 18419 df-p0 18495 df-p1 18496 df-lat 18502 df-clat 18569 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-submnd 18819 df-grp 18976 df-minusg 18977 df-sbg 18978 df-subg 19163 df-cntz 19357 df-oppg 19386 df-lsm 19678 df-cmn 19824 df-abl 19825 df-mgp 20162 df-rng 20180 df-ur 20209 df-ring 20262 df-oppr 20360 df-dvdsr 20383 df-unit 20384 df-invr 20414 df-dvr 20427 df-nzr 20539 df-rlreg 20716 df-domn 20717 df-drng 20753 df-lmod 20882 df-lss 20953 df-lsp 20993 df-lvec 21125 df-lsatoms 38932 df-lshyp 38933 df-lcv 38975 df-lfl 39014 df-lkr 39042 df-ldual 39080 df-oposet 39132 df-ol 39134 df-oml 39135 df-covers 39222 df-ats 39223 df-atl 39254 df-cvlat 39278 df-hlat 39307 df-llines 39455 df-lplanes 39456 df-lvols 39457 df-lines 39458 df-psubsp 39460 df-pmap 39461 df-padd 39753 df-lhyp 39945 df-laut 39946 df-ldil 40061 df-ltrn 40062 df-trl 40116 df-tgrp 40700 df-tendo 40712 df-edring 40714 df-dveca 40960 df-disoa 40986 df-dvech 41036 df-dib 41096 df-dic 41130 df-dih 41186 df-doch 41305 df-djh 41352 df-lcdual 41544 df-mapd 41582

This theorem is referenced by: mapdh6kN 41703

W3C validator