Theorem hdmap1valc 42173

Description: Connect the value of the preliminary map from vectors to functionals 𝐼 to the hypothesis 𝐿 used by earlier theorems. Note: the 𝑋 ∈ (𝑉 ∖ { 0 }) hypothesis could be the more general 𝑋 ∈ 𝑉 but the former will be easier to use. TODO: use the 𝐼 function directly in those theorems, so this theorem becomes unnecessary? TODO: The hdmap1cbv 42172 is probably unnecessary, but it would mean different $d's later on. (Contributed by NM, 15-May-2015.)

Hypotheses

Ref	Expression
hdmap1valc.h	⊢ 𝐻 = (LHyp‘𝐾)
hdmap1valc.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
hdmap1valc.v	⊢ 𝑉 = (Base‘𝑈)
hdmap1valc.s	⊢ − = (-g‘𝑈)
hdmap1valc.o	⊢ 0 = (0g‘𝑈)
hdmap1valc.n	⊢ 𝑁 = (LSpan‘𝑈)
hdmap1valc.c	⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
hdmap1valc.d	⊢ 𝐷 = (Base‘𝐶)
hdmap1valc.r	⊢ 𝑅 = (-g‘𝐶)
hdmap1valc.q	⊢ 𝑄 = (0g‘𝐶)
hdmap1valc.j	⊢ 𝐽 = (LSpan‘𝐶)
hdmap1valc.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
hdmap1valc.i	⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊)
hdmap1valc.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
hdmap1valc.x	⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
hdmap1valc.f	⊢ (𝜑 → 𝐹 ∈ 𝐷)
hdmap1valc.y	⊢ (𝜑 → 𝑌 ∈ 𝑉)
hdmap1valc.l	⊢ 𝐿 = (𝑥 ∈ V ↦ if((2nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑥)) − (2nd ‘𝑥))})) = (𝐽‘{((2nd ‘(1st ‘𝑥))𝑅ℎ)})))))

Assertion

Ref	Expression
hdmap1valc	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐿‘⟨𝑋, 𝐹, 𝑌⟩))

Distinct variable groups:   𝑥, 0   𝑥,ℎ,𝐷   ℎ,𝐽,𝑥   ℎ,𝑀,𝑥   − ,ℎ,𝑥   ℎ,𝑁,𝑥   𝑅,ℎ,𝑥   𝑥,𝑄

Allowed substitution hints:   𝜑(𝑥,ℎ)   𝐶(𝑥,ℎ)   𝑄(ℎ)   𝑈(𝑥,ℎ)   𝐹(𝑥,ℎ)   𝐻(𝑥,ℎ)   𝐼(𝑥,ℎ)   𝐾(𝑥,ℎ)   𝐿(𝑥,ℎ)   𝑉(𝑥,ℎ)   𝑊(𝑥,ℎ)   𝑋(𝑥,ℎ)   𝑌(𝑥,ℎ)   0 (ℎ)

Proof of Theorem hdmap1valc

Dummy variables 𝑤 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		hdmap1valc.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
2		hdmap1valc.u	. . 3 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
3		hdmap1valc.v	. . 3 ⊢ 𝑉 = (Base‘𝑈)
4		hdmap1valc.s	. . 3 ⊢ − = (-g‘𝑈)
5		hdmap1valc.o	. . 3 ⊢ 0 = (0g‘𝑈)
6		hdmap1valc.n	. . 3 ⊢ 𝑁 = (LSpan‘𝑈)
7		hdmap1valc.c	. . 3 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
8		hdmap1valc.d	. . 3 ⊢ 𝐷 = (Base‘𝐶)
9		hdmap1valc.r	. . 3 ⊢ 𝑅 = (-g‘𝐶)
10		hdmap1valc.q	. . 3 ⊢ 𝑄 = (0g‘𝐶)
11		hdmap1valc.j	. . 3 ⊢ 𝐽 = (LSpan‘𝐶)
12		hdmap1valc.m	. . 3 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
13		hdmap1valc.i	. . 3 ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊)
14		hdmap1valc.k	. . 3 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
15		hdmap1valc.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
16	15	eldifad 3915	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
17		hdmap1valc.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
18		hdmap1valc.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
19	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18	hdmap1val 42168	. 2 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (℩𝑔 ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑔}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅𝑔)})))))
20		hdmap1valc.l	. . . 4 ⊢ 𝐿 = (𝑥 ∈ V ↦ if((2nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑥)) − (2nd ‘𝑥))})) = (𝐽‘{((2nd ‘(1st ‘𝑥))𝑅ℎ)})))))
21	20	hdmap1cbv 42172	. . 3 ⊢ 𝐿 = (𝑤 ∈ V ↦ if((2nd ‘𝑤) = 0 , 𝑄, (℩𝑔 ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑤)})) = (𝐽‘{𝑔}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑤)) − (2nd ‘𝑤))})) = (𝐽‘{((2nd ‘(1st ‘𝑤))𝑅𝑔)})))))
22	10, 21, 16, 17, 18	mapdhval 42094	. 2 ⊢ (𝜑 → (𝐿‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (℩𝑔 ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑔}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅𝑔)})))))
23	19, 22	eqtr4d 2775	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐿‘⟨𝑋, 𝐹, 𝑌⟩))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  Vcvv 3442   ∖ cdif 3900  ifcif 4481  {csn 4582  ⟨cotp 4590   ↦ cmpt 5181  ‘cfv 6500  ℩crio 7324  (class class class)co 7368  1^st c1st 7941  2^nd c2nd 7942  Basecbs 17148  0_gc0g 17371  -_gcsg 18877  LSpanclspn 20934  HLchlt 39720  LHypclh 40354  DVecHcdvh 41448  LCDualclcd 41956  mapdcmpd 41994  HDMap1chdma1 42161

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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  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-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-ot 4591  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-1st 7943  df-2nd 7944  df-hdmap1 42163

This theorem is referenced by:  hdmap1cl  42174  hdmap1eq2  42175  hdmap1eq4N  42176  hdmap1eulem  42192  hdmap1eulemOLDN  42193