mapdh6jN - Mathbox for Norm Megill

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

Theorem mapdh6jN 42202

Description: Lemmma for mapdh6N 42204. Eliminate (𝑁‘{𝑌}) = (𝑁‘{𝑍}) hypothesis. (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 }))

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

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

**Proof of Theorem mapdh6jN**
Step	Hyp	Ref	Expression
1		mapdh.q	. . 3 ⊢ 𝑄 = (0_g‘𝐶)
2		mapdh.i	. . 3 ⊢ 𝐼 = (𝑥 ∈ V ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))
3		mapdh.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
4		mapdh.m	. . 3 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
5		mapdh.u	. . 3 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
6		mapdh.v	. . 3 ⊢ 𝑉 = (Base‘𝑈)
7		mapdh.s	. . 3 ⊢ − = (-_g‘𝑈)
8		mapdhc.o	. . 3 ⊢ 0 = (0_g‘𝑈)
9		mapdh.n	. . 3 ⊢ 𝑁 = (LSpan‘𝑈)
10		mapdh.c	. . 3 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
11		mapdh.d	. . 3 ⊢ 𝐷 = (Base‘𝐶)
12		mapdh.r	. . 3 ⊢ 𝑅 = (-_g‘𝐶)
13		mapdh.j	. . 3 ⊢ 𝐽 = (LSpan‘𝐶)
14		mapdh.k	. . . 4 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
15	14	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
16		mapdhc.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
17	16	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → 𝐹 ∈ 𝐷)
18		mapdh.mn	. . . 4 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
19	18	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
20		mapdhcl.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
21	20	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → 𝑋 ∈ (𝑉 ∖ { 0 }))
22		mapdh.p	. . 3 ⊢ + = (+_g‘𝑈)
23		mapdh.a	. . 3 ⊢ ✚ = (+_g‘𝐶)
24		mapdh6i.xn	. . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
25	24	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
26		mapdh6i.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
27	26	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → 𝑌 ∈ (𝑉 ∖ { 0 }))
28		mapdh6i.z	. . . 4 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
29	28	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → 𝑍 ∈ (𝑉 ∖ { 0 }))
30		simpr 484	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))
31	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 21, 22, 23, 25, 27, 29, 30	mapdh6iN 42201	. 2 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
32	14	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
33	16	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → 𝐹 ∈ 𝐷)
34	18	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
35	20	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → 𝑋 ∈ (𝑉 ∖ { 0 }))
36	26	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → 𝑌 ∈ (𝑉 ∖ { 0 }))
37	28	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → 𝑍 ∈ (𝑉 ∖ { 0 }))
38	24	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
39		simpr 484	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))
40		eqidd 2738	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑌⟩))
41		eqidd 2738	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑍⟩))
42	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 32, 33, 34, 35, 22, 23, 36, 37, 38, 39, 40, 41	mapdh6aN 42192	. 2 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
43	31, 42	pm2.61dane 3020	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 Vcvv 3430 ∖ cdif 3887 ifcif 4467 {csn 4568 {cpr 4570 ⟨cotp 4576 ↦ cmpt 5167 ‘cfv 6490 ℩crio 7314 (class class class)co 7358 1^st c1st 7931 2^nd c2nd 7932 Basecbs 17168 +_gcplusg 17209 0_gc0g 17391 -_gcsg 18900 LSpanclspn 20955 HLchlt 39807 LHypclh 40441 DVecHcdvh 41535 LCDualclcd 42043 mapdcmpd 42081

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-riotaBAD 39410

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-ot 4577 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-om 7809 df-1st 7933 df-2nd 7934 df-tpos 8167 df-undef 8214 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-2o 8397 df-er 8634 df-map 8766 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-2 12233 df-3 12234 df-4 12235 df-5 12236 df-6 12237 df-n0 12427 df-z 12514 df-uz 12778 df-fz 13451 df-struct 17106 df-sets 17123 df-slot 17141 df-ndx 17153 df-base 17169 df-ress 17190 df-plusg 17222 df-mulr 17223 df-sca 17225 df-vsca 17226 df-0g 17393 df-mre 17537 df-mrc 17538 df-acs 17540 df-proset 18249 df-poset 18268 df-plt 18283 df-lub 18299 df-glb 18300 df-join 18301 df-meet 18302 df-p0 18378 df-p1 18379 df-lat 18387 df-clat 18454 df-mgm 18597 df-sgrp 18676 df-mnd 18692 df-submnd 18741 df-grp 18901 df-minusg 18902 df-sbg 18903 df-subg 19088 df-cntz 19281 df-oppg 19310 df-lsm 19600 df-cmn 19746 df-abl 19747 df-mgp 20111 df-rng 20123 df-ur 20152 df-ring 20205 df-oppr 20306 df-dvdsr 20326 df-unit 20327 df-invr 20357 df-dvr 20370 df-nzr 20479 df-rlreg 20660 df-domn 20661 df-drng 20697 df-lmod 20846 df-lss 20916 df-lsp 20956 df-lvec 21088 df-lsatoms 39433 df-lshyp 39434 df-lcv 39476 df-lfl 39515 df-lkr 39543 df-ldual 39581 df-oposet 39633 df-ol 39635 df-oml 39636 df-covers 39723 df-ats 39724 df-atl 39755 df-cvlat 39779 df-hlat 39808 df-llines 39955 df-lplanes 39956 df-lvols 39957 df-lines 39958 df-psubsp 39960 df-pmap 39961 df-padd 40253 df-lhyp 40445 df-laut 40446 df-ldil 40561 df-ltrn 40562 df-trl 40616 df-tgrp 41200 df-tendo 41212 df-edring 41214 df-dveca 41460 df-disoa 41486 df-dvech 41536 df-dib 41596 df-dic 41630 df-dih 41686 df-doch 41805 df-djh 41852 df-lcdual 42044 df-mapd 42082

This theorem is referenced by: mapdh6kN 42203

W3C validator