mapdh8d0N - Mathbox for Norm Megill

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

Theorem mapdh8d0N 37858

Description: Part of Part (8) in [Baer] p. 48. (Contributed by NM, 10-May-2015.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
mapdh8a.h	⊢ 𝐻 = (LHyp‘𝐾)
mapdh8a.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
mapdh8a.v	⊢ 𝑉 = (Base‘𝑈)
mapdh8a.s	⊢ − = (-_g‘𝑈)
mapdh8a.o	⊢ 0 = (0_g‘𝑈)
mapdh8a.n	⊢ 𝑁 = (LSpan‘𝑈)
mapdh8a.c	⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
mapdh8a.d	⊢ 𝐷 = (Base‘𝐶)
mapdh8a.r	⊢ 𝑅 = (-_g‘𝐶)
mapdh8a.q	⊢ 𝑄 = (0_g‘𝐶)
mapdh8a.j	⊢ 𝐽 = (LSpan‘𝐶)
mapdh8a.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
mapdh8a.i	⊢ 𝐼 = (𝑥 ∈ V ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))
mapdh8a.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
mapdh8d.f	⊢ (𝜑 → 𝐹 ∈ 𝐷)
mapdh8d.mn	⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
mapdh8b.eg	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)
mapdh8d.x	⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
mapdh8d.y	⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
mapdh8d.xt	⊢ (𝜑 → 𝑇 ∈ (𝑉 ∖ { 0 }))
mapdh8d.yz	⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))
mapdh8d.w	⊢ (𝜑 → 𝑤 ∈ (𝑉 ∖ { 0 }))
mapdh8d.wt	⊢ (𝜑 → (𝑁‘{𝑤}) ≠ (𝑁‘{𝑇}))
mapdh8d.ut	⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))
mapdh8d.vw	⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑤}))
mapdh8d.xn	⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑤}))
mapdh8d0.e	⊢ (𝜑 → 𝑋 ∈ (𝑁‘{𝑌, 𝑇}))

**Assertion**
Ref	Expression
mapdh8d0N	⊢ (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))

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

**Proof of Theorem mapdh8d0N**
Step	Hyp	Ref	Expression
1		mapdh8a.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
2		mapdh8a.u	. . 3 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
3		mapdh8a.v	. . 3 ⊢ 𝑉 = (Base‘𝑈)
4		mapdh8a.s	. . 3 ⊢ − = (-_g‘𝑈)
5		mapdh8a.o	. . 3 ⊢ 0 = (0_g‘𝑈)
6		mapdh8a.n	. . 3 ⊢ 𝑁 = (LSpan‘𝑈)
7		mapdh8a.c	. . 3 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
8		mapdh8a.d	. . 3 ⊢ 𝐷 = (Base‘𝐶)
9		mapdh8a.r	. . 3 ⊢ 𝑅 = (-_g‘𝐶)
10		mapdh8a.q	. . 3 ⊢ 𝑄 = (0_g‘𝐶)
11		mapdh8a.j	. . 3 ⊢ 𝐽 = (LSpan‘𝐶)
12		mapdh8a.m	. . 3 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
13		mapdh8a.i	. . 3 ⊢ 𝐼 = (𝑥 ∈ V ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))
14		mapdh8a.k	. . 3 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
15		mapdh8b.eg	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)
16		mapdh8d.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
17		mapdh8d.mn	. . . . 5 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
18		mapdh8d.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
19		mapdh8d.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
20	19	eldifad 3811	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
21	1, 2, 14	dvhlvec 37185	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ LVec)
22	18	eldifad 3811	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
23		mapdh8d.w	. . . . . . . 8 ⊢ (𝜑 → 𝑤 ∈ (𝑉 ∖ { 0 }))
24	23	eldifad 3811	. . . . . . 7 ⊢ (𝜑 → 𝑤 ∈ 𝑉)
25		mapdh8d.xn	. . . . . . 7 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑤}))
26	3, 6, 21, 22, 20, 24, 25	lspindpi 19493	. . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) ∧ (𝑁‘{𝑋}) ≠ (𝑁‘{𝑤})))
27	26	simpld 490	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
28	10, 13, 1, 12, 2, 3, 4, 5, 6, 7, 8, 9, 11, 14, 16, 17, 18, 20, 27	mapdhcl 37803	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷)
29	15, 28	eqeltrrd 2908	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐷)
30	10, 13, 1, 12, 2, 3, 4, 5, 6, 7, 8, 9, 11, 14, 16, 17, 18, 19, 29, 27	mapdheq 37804	. . . . 5 ⊢ (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺 ↔ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝐺}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅𝐺)}))))
31	15, 30	mpbid 224	. . . 4 ⊢ (𝜑 → ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝐺}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅𝐺)})))
32	31	simpld 490	. . 3 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝐺}))
33		mapdh8d.vw	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑤}))
34	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 15, 18, 19, 33, 23, 25	mapdh8a 37851	. . 3 ⊢ (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑤⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑤⟩))
35		mapdh8d.wt	. . 3 ⊢ (𝜑 → (𝑁‘{𝑤}) ≠ (𝑁‘{𝑇}))
36		mapdh8d.xt	. . 3 ⊢ (𝜑 → 𝑇 ∈ (𝑉 ∖ { 0 }))
37		mapdh8d0.e	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑁‘{𝑌, 𝑇}))
38	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 29, 32, 34, 19, 23, 35, 36, 33, 37, 25	mapdh8b 37856	. 2 ⊢ (𝜑 → (𝐼‘⟨𝑤, (𝐼‘⟨𝑋, 𝐹, 𝑤⟩), 𝑇⟩) = (𝐼‘⟨𝑌, 𝐺, 𝑇⟩))
39		eqidd 2827	. . 3 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑤⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑤⟩))
40		mapdh8d.yz	. . 3 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))
41		mapdh8d.ut	. . 3 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))
42	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 39, 18, 19, 36, 40, 23, 35, 41, 33, 37, 25	mapdh8c 37857	. 2 ⊢ (𝜑 → (𝐼‘⟨𝑤, (𝐼‘⟨𝑋, 𝐹, 𝑤⟩), 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
43	38, 42	eqtr3d 2864	1 ⊢ (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 386 = wceq 1658 ∈ wcel 2166 ≠ wne 3000 Vcvv 3415 ∖ cdif 3796 ifcif 4307 {csn 4398 {cpr 4400 ⟨cotp 4406 ↦ cmpt 4953 ‘cfv 6124 ℩crio 6866 (class class class)co 6906 1^st c1st 7427 2^nd c2nd 7428 Basecbs 16223 0_gc0g 16454 -_gcsg 17779 LSpanclspn 19331 HLchlt 35426 LHypclh 36060 DVecHcdvh 37154 LCDualclcd 37662 mapdcmpd 37700

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1896 ax-4 1910 ax-5 2011 ax-6 2077 ax-7 2114 ax-8 2168 ax-9 2175 ax-10 2194 ax-11 2209 ax-12 2222 ax-13 2391 ax-ext 2804 ax-rep 4995 ax-sep 5006 ax-nul 5014 ax-pow 5066 ax-pr 5128 ax-un 7210 ax-cnex 10309 ax-resscn 10310 ax-1cn 10311 ax-icn 10312 ax-addcl 10313 ax-addrcl 10314 ax-mulcl 10315 ax-mulrcl 10316 ax-mulcom 10317 ax-addass 10318 ax-mulass 10319 ax-distr 10320 ax-i2m1 10321 ax-1ne0 10322 ax-1rid 10323 ax-rnegex 10324 ax-rrecex 10325 ax-cnre 10326 ax-pre-lttri 10327 ax-pre-lttrn 10328 ax-pre-ltadd 10329 ax-pre-mulgt0 10330 ax-riotaBAD 35029

This theorem depends on definitions: df-bi 199 df-an 387 df-or 881 df-3or 1114 df-3an 1115 df-tru 1662 df-fal 1672 df-ex 1881 df-nf 1885 df-sb 2070 df-mo 2606 df-eu 2641 df-clab 2813 df-cleq 2819 df-clel 2822 df-nfc 2959 df-ne 3001 df-nel 3104 df-ral 3123 df-rex 3124 df-reu 3125 df-rmo 3126 df-rab 3127 df-v 3417 df-sbc 3664 df-csb 3759 df-dif 3802 df-un 3804 df-in 3806 df-ss 3813 df-pss 3815 df-nul 4146 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-ot 4407 df-uni 4660 df-int 4699 df-iun 4743 df-iin 4744 df-br 4875 df-opab 4937 df-mpt 4954 df-tr 4977 df-id 5251 df-eprel 5256 df-po 5264 df-so 5265 df-fr 5302 df-we 5304 df-xp 5349 df-rel 5350 df-cnv 5351 df-co 5352 df-dm 5353 df-rn 5354 df-res 5355 df-ima 5356 df-pred 5921 df-ord 5967 df-on 5968 df-lim 5969 df-suc 5970 df-iota 6087 df-fun 6126 df-fn 6127 df-f 6128 df-f1 6129 df-fo 6130 df-f1o 6131 df-fv 6132 df-riota 6867 df-ov 6909 df-oprab 6910 df-mpt2 6911 df-of 7158 df-om 7328 df-1st 7429 df-2nd 7430 df-tpos 7618 df-undef 7665 df-wrecs 7673 df-recs 7735 df-rdg 7773 df-1o 7827 df-oadd 7831 df-er 8010 df-map 8125 df-en 8224 df-dom 8225 df-sdom 8226 df-fin 8227 df-pnf 10394 df-mnf 10395 df-xr 10396 df-ltxr 10397 df-le 10398 df-sub 10588 df-neg 10589 df-nn 11352 df-2 11415 df-3 11416 df-4 11417 df-5 11418 df-6 11419 df-n0 11620 df-z 11706 df-uz 11970 df-fz 12621 df-struct 16225 df-ndx 16226 df-slot 16227 df-base 16229 df-sets 16230 df-ress 16231 df-plusg 16319 df-mulr 16320 df-sca 16322 df-vsca 16323 df-0g 16456 df-mre 16600 df-mrc 16601 df-acs 16603 df-proset 17282 df-poset 17300 df-plt 17312 df-lub 17328 df-glb 17329 df-join 17330 df-meet 17331 df-p0 17393 df-p1 17394 df-lat 17400 df-clat 17462 df-mgm 17596 df-sgrp 17638 df-mnd 17649 df-submnd 17690 df-grp 17780 df-minusg 17781 df-sbg 17782 df-subg 17943 df-cntz 18101 df-oppg 18127 df-lsm 18403 df-cmn 18549 df-abl 18550 df-mgp 18845 df-ur 18857 df-ring 18904 df-oppr 18978 df-dvdsr 18996 df-unit 18997 df-invr 19027 df-dvr 19038 df-drng 19106 df-lmod 19222 df-lss 19290 df-lsp 19332 df-lvec 19463 df-lsatoms 35052 df-lshyp 35053 df-lcv 35095 df-lfl 35134 df-lkr 35162 df-ldual 35200 df-oposet 35252 df-ol 35254 df-oml 35255 df-covers 35342 df-ats 35343 df-atl 35374 df-cvlat 35398 df-hlat 35427 df-llines 35574 df-lplanes 35575 df-lvols 35576 df-lines 35577 df-psubsp 35579 df-pmap 35580 df-padd 35872 df-lhyp 36064 df-laut 36065 df-ldil 36180 df-ltrn 36181 df-trl 36235 df-tgrp 36819 df-tendo 36831 df-edring 36833 df-dveca 37079 df-disoa 37105 df-dvech 37155 df-dib 37215 df-dic 37249 df-dih 37305 df-doch 37424 df-djh 37471 df-lcdual 37663 df-mapd 37701

This theorem is referenced by: (None)

W3C validator