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 42317

Description: Lemmma for mapdh6N 42319. 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 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
16		mapdhc.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
17	16	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → 𝐹 ∈ 𝐷)
18		mapdh.mn	. . . 4 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
19	18	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
20		mapdhcl.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
21	20	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → 𝑋 ∈ (𝑉 ∖ { 0 }))
22		mapdh.p	. . 3 ⊢ + = (+_g‘𝑈)
23		mapdh.a	. . 3 ⊢ ✚ = (+_g‘𝐶)
24		mapdh6i.xn	. . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
25	24	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
26		mapdh6i.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
27	26	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → 𝑌 ∈ (𝑉 ∖ { 0 }))
28		mapdh6i.z	. . . 4 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
29	28	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → 𝑍 ∈ (𝑉 ∖ { 0 }))
30		simpr 487	. . 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 42316	. 2 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) = (𝑁‘{𝑍})) → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
32	14	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
33	16	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → 𝐹 ∈ 𝐷)
34	18	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
35	20	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → 𝑋 ∈ (𝑉 ∖ { 0 }))
36	26	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → 𝑌 ∈ (𝑉 ∖ { 0 }))
37	28	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → 𝑍 ∈ (𝑉 ∖ { 0 }))
38	24	adantr 483	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
39		simpr 487	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))
40		eqidd 2757	. . 3 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑌⟩))
41		eqidd 2757	. . 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 42307	. 2 ⊢ ((𝜑 ∧ (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
43	31, 42	pm2.61dane 3038	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ✚ (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1554 ∈ wcel 2136 ≠ wne 2951 Vcvv 3448 ∖ cdif 3896 ifcif 4474 {csn 4576 {cpr 4578 ⟨cotp 4584 ↦ cmpt 5175 ‘cfv 6510 ℩crio 7341 (class class class)co 7385 1^st c1st 7957 2^nd c2nd 7958 Basecbs 17221 +_gcplusg 17262 0_gc0g 17444 -_gcsg 18953 LSpanclspn 21011 HLchlt 39922 LHypclh 40556 DVecHcdvh 41650 LCDualclcd 42158 mapdcmpd 42196

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 ax-riotaBAD 39525

This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-ot 4585 df-uni 4860 df-int 4900 df-iun 4945 df-iin 4946 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-of 7649 df-om 7836 df-1st 7959 df-2nd 7960 df-tpos 8194 df-undef 8241 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-1o 8425 df-2o 8426 df-er 8666 df-map 8798 df-en 8917 df-dom 8918 df-sdom 8919 df-fin 8920 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-nn 12201 df-2 12270 df-3 12271 df-4 12272 df-5 12273 df-6 12274 df-n0 12472 df-z 12559 df-uz 12830 df-fz 13503 df-struct 17159 df-sets 17176 df-slot 17194 df-ndx 17206 df-base 17222 df-ress 17243 df-plusg 17275 df-mulr 17276 df-sca 17278 df-vsca 17279 df-0g 17446 df-mre 17590 df-mrc 17591 df-acs 17593 df-proset 18302 df-poset 18321 df-plt 18336 df-lub 18352 df-glb 18353 df-join 18354 df-meet 18355 df-p0 18431 df-p1 18432 df-lat 18440 df-clat 18507 df-mgm 18650 df-sgrp 18729 df-mnd 18745 df-submnd 18794 df-grp 18954 df-minusg 18955 df-sbg 18956 df-subg 19141 df-cntz 19333 df-oppg 19362 df-lsm 19652 df-cmn 19798 df-abl 19799 df-mgp 20163 df-rng 20175 df-ur 20204 df-ring 20257 df-oppr 20358 df-dvdsr 20378 df-unit 20379 df-invr 20409 df-dvr 20422 df-nzr 20535 df-rlreg 20716 df-domn 20717 df-drng 20753 df-lmod 20902 df-lss 20972 df-lsp 21012 df-lvec 21143 df-lsatoms 39548 df-lshyp 39549 df-lcv 39591 df-lfl 39630 df-lkr 39658 df-ldual 39696 df-oposet 39748 df-ol 39750 df-oml 39751 df-covers 39838 df-ats 39839 df-atl 39870 df-cvlat 39894 df-hlat 39923 df-llines 40070 df-lplanes 40071 df-lvols 40072 df-lines 40073 df-psubsp 40075 df-pmap 40076 df-padd 40368 df-lhyp 40560 df-laut 40561 df-ldil 40676 df-ltrn 40677 df-trl 40731 df-tgrp 41315 df-tendo 41327 df-edring 41329 df-dveca 41575 df-disoa 41601 df-dvech 41651 df-dib 41711 df-dic 41745 df-dih 41801 df-doch 41920 df-djh 41967 df-lcdual 42159 df-mapd 42197

This theorem is referenced by: mapdh6kN 42318

W3C validator