mapdh8g - Mathbox for Norm Megill

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

Theorem mapdh8g 40525

Description: Part of Part (8) in [Baer] p. 48. Eliminate 𝑋 ∈ (𝑁‘{𝑌, 𝑇}). TODO: break out 𝑇 ≠ 0 in mapdh8e 40524 so we can share hypotheses. Also, look at hypothesis sharing for earlier mapdh8* and mapdh75* stuff. (Contributed by NM, 10-May-2015.)

**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 ∧ 𝑊 ∈ 𝐻))
mapdh8e.f	⊢ (𝜑 → 𝐹 ∈ 𝐷)
mapdh8e.mn	⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
mapdh8e.eg	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)
mapdh8e.x	⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
mapdh8e.y	⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
mapdh8e.t	⊢ (𝜑 → 𝑇 ∈ (𝑉 ∖ { 0 }))
mapdh8e.xy	⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
mapdh8e.xt	⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))
mapdh8e.yt	⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))

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

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

**Proof of Theorem mapdh8g**
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	. . . 4 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
15	14	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
16		mapdh8e.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
17	16	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → 𝐹 ∈ 𝐷)
18		mapdh8e.mn	. . . 4 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
19	18	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
20		mapdh8e.eg	. . . 4 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)
21	20	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)
22		mapdh8e.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
23	22	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → 𝑋 ∈ (𝑉 ∖ { 0 }))
24		mapdh8e.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
25	24	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → 𝑌 ∈ (𝑉 ∖ { 0 }))
26		mapdh8e.t	. . . 4 ⊢ (𝜑 → 𝑇 ∈ (𝑉 ∖ { 0 }))
27	26	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → 𝑇 ∈ (𝑉 ∖ { 0 }))
28		mapdh8e.xy	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
29	28	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
30		mapdh8e.xt	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))
31	30	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))
32		mapdh8e.yt	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))
33	32	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))
34		simpr 485	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → 𝑋 ∈ (𝑁‘{𝑌, 𝑇}))
35	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 34	mapdh8e 40524	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
36	14	adantr 481	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
37	16	adantr 481	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → 𝐹 ∈ 𝐷)
38	18	adantr 481	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))
39	20	adantr 481	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)
40	22	adantr 481	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → 𝑋 ∈ (𝑉 ∖ { 0 }))
41	24	adantr 481	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → 𝑌 ∈ (𝑉 ∖ { 0 }))
42	32	adantr 481	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))
43	26	adantr 481	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → 𝑇 ∈ (𝑉 ∖ { 0 }))
44		simpr 485	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇}))
45	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 36, 37, 38, 39, 40, 41, 42, 43, 44	mapdh8a 40515	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇})) → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
46	35, 45	pm2.61dan 811	1 ⊢ (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 Vcvv 3474 ∖ cdif 3942 ifcif 4523 {csn 4623 {cpr 4625 ⟨cotp 4631 ↦ cmpt 5225 ‘cfv 6533 ℩crio 7349 (class class class)co 7394 1^st c1st 7957 2^nd c2nd 7958 Basecbs 17128 0_gc0g 17369 -_gcsg 18798 LSpanclspn 20533 HLchlt 38089 LHypclh 38724 DVecHcdvh 39818 LCDualclcd 40326 mapdcmpd 40364

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5357 ax-pr 5421 ax-un 7709 ax-cnex 11150 ax-resscn 11151 ax-1cn 11152 ax-icn 11153 ax-addcl 11154 ax-addrcl 11155 ax-mulcl 11156 ax-mulrcl 11157 ax-mulcom 11158 ax-addass 11159 ax-mulass 11160 ax-distr 11161 ax-i2m1 11162 ax-1ne0 11163 ax-1rid 11164 ax-rnegex 11165 ax-rrecex 11166 ax-cnre 11167 ax-pre-lttri 11168 ax-pre-lttrn 11169 ax-pre-ltadd 11170 ax-pre-mulgt0 11171 ax-riotaBAD 37692

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3964 df-nul 4320 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-tp 4628 df-op 4630 df-ot 4632 df-uni 4903 df-int 4945 df-iun 4993 df-iin 4994 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5568 df-eprel 5574 df-po 5582 df-so 5583 df-fr 5625 df-we 5627 df-xp 5676 df-rel 5677 df-cnv 5678 df-co 5679 df-dm 5680 df-rn 5681 df-res 5682 df-ima 5683 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7350 df-ov 7397 df-oprab 7398 df-mpo 7399 df-of 7654 df-om 7840 df-1st 7959 df-2nd 7960 df-tpos 8195 df-undef 8242 df-frecs 8250 df-wrecs 8281 df-recs 8355 df-rdg 8394 df-1o 8450 df-er 8688 df-map 8807 df-en 8925 df-dom 8926 df-sdom 8927 df-fin 8928 df-pnf 11234 df-mnf 11235 df-xr 11236 df-ltxr 11237 df-le 11238 df-sub 11430 df-neg 11431 df-nn 12197 df-2 12259 df-3 12260 df-4 12261 df-5 12262 df-6 12263 df-n0 12457 df-z 12543 df-uz 12807 df-fz 13469 df-struct 17064 df-sets 17081 df-slot 17099 df-ndx 17111 df-base 17129 df-ress 17158 df-plusg 17194 df-mulr 17195 df-sca 17197 df-vsca 17198 df-0g 17371 df-mre 17514 df-mrc 17515 df-acs 17517 df-proset 18232 df-poset 18250 df-plt 18267 df-lub 18283 df-glb 18284 df-join 18285 df-meet 18286 df-p0 18362 df-p1 18363 df-lat 18369 df-clat 18436 df-mgm 18545 df-sgrp 18594 df-mnd 18605 df-submnd 18650 df-grp 18799 df-minusg 18800 df-sbg 18801 df-subg 18977 df-cntz 19149 df-oppg 19176 df-lsm 19470 df-cmn 19616 df-abl 19617 df-mgp 19949 df-ur 19966 df-ring 20018 df-oppr 20104 df-dvdsr 20125 df-unit 20126 df-invr 20156 df-dvr 20167 df-drng 20269 df-lmod 20424 df-lss 20494 df-lsp 20534 df-lvec 20665 df-lsatoms 37715 df-lshyp 37716 df-lcv 37758 df-lfl 37797 df-lkr 37825 df-ldual 37863 df-oposet 37915 df-ol 37917 df-oml 37918 df-covers 38005 df-ats 38006 df-atl 38037 df-cvlat 38061 df-hlat 38090 df-llines 38238 df-lplanes 38239 df-lvols 38240 df-lines 38241 df-psubsp 38243 df-pmap 38244 df-padd 38536 df-lhyp 38728 df-laut 38729 df-ldil 38844 df-ltrn 38845 df-trl 38899 df-tgrp 39483 df-tendo 39495 df-edring 39497 df-dveca 39743 df-disoa 39769 df-dvech 39819 df-dib 39879 df-dic 39913 df-dih 39969 df-doch 40088 df-djh 40135 df-lcdual 40327 df-mapd 40365

This theorem is referenced by: mapdh8i 40526

W3C validator