Theorem hdmap1valc 41164

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 41163 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 3952	. . 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 41159	. 2 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (℩𝑔 ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑔}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅𝑔)})))))
20		hdmap1valc.l	. . . 4 ⊢ 𝐿 = (𝑥 ∈ V ↦ if((2nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑥)) − (2nd ‘𝑥))})) = (𝐽‘{((2nd ‘(1st ‘𝑥))𝑅ℎ)})))))
21	20	hdmap1cbv 41163	. . 3 ⊢ 𝐿 = (𝑤 ∈ V ↦ if((2nd ‘𝑤) = 0 , 𝑄, (℩𝑔 ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑤)})) = (𝐽‘{𝑔}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑤)) − (2nd ‘𝑤))})) = (𝐽‘{((2nd ‘(1st ‘𝑤))𝑅𝑔)})))))
22	10, 21, 16, 17, 18	mapdhval 41085	. 2 ⊢ (𝜑 → (𝐿‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (℩𝑔 ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑔}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅𝑔)})))))
23	19, 22	eqtr4d 2767	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐿‘⟨𝑋, 𝐹, 𝑌⟩))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1533   ∈ wcel 2098  Vcvv 3466   ∖ cdif 3937  ifcif 4520  {csn 4620  ⟨cotp 4628   ↦ cmpt 5221  ‘cfv 6533  ℩crio 7356  (class class class)co 7401  1^st c1st 7966  2^nd c2nd 7967  Basecbs 17143  0_gc0g 17384  -_gcsg 18855  LSpanclspn 20808  HLchlt 38710  LHypclh 39345  DVecHcdvh 40439  LCDualclcd 40947  mapdcmpd 40985  HDMap1chdma1 41152

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-rep 5275  ax-sep 5289  ax-nul 5296  ax-pow 5353  ax-pr 5417  ax-un 7718

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ne 2933  df-ral 3054  df-rex 3063  df-reu 3369  df-rab 3425  df-v 3468  df-sbc 3770  df-csb 3886  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-nul 4315  df-if 4521  df-pw 4596  df-sn 4621  df-pr 4623  df-op 4627  df-ot 4629  df-uni 4900  df-iun 4989  df-br 5139  df-opab 5201  df-mpt 5222  df-id 5564  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  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 7357  df-ov 7404  df-1st 7968  df-2nd 7969  df-hdmap1 41154

This theorem is referenced by:  hdmap1cl  41165  hdmap1eq2  41166  hdmap1eq4N  41167  hdmap1eulem  41183  hdmap1eulemOLDN  41184