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

Theorem hdmap1valc 41804
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 41803 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.
StepHypRef 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 }))
1615eldifad 3929 . . 3 (𝜑𝑋𝑉)
17 hdmap1valc.f . . 3 (𝜑𝐹𝐷)
18 hdmap1valc.y . . 3 (𝜑𝑌𝑉)
191, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18hdmap1val 41799 . 2 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (𝑔𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑔}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅𝑔)})))))
20 hdmap1valc.l . . . 4 𝐿 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))
2120hdmap1cbv 41803 . . 3 𝐿 = (𝑤 ∈ V ↦ if((2nd𝑤) = 0 , 𝑄, (𝑔𝐷 ((𝑀‘(𝑁‘{(2nd𝑤)})) = (𝐽‘{𝑔}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑤)) (2nd𝑤))})) = (𝐽‘{((2nd ‘(1st𝑤))𝑅𝑔)})))))
2210, 21, 16, 17, 18mapdhval 41725 . 2 (𝜑 → (𝐿‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (𝑔𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑔}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅𝑔)})))))
2319, 22eqtr4d 2768 1 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐿‘⟨𝑋, 𝐹, 𝑌⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  Vcvv 3450  cdif 3914  ifcif 4491  {csn 4592  cotp 4600  cmpt 5191  cfv 6514  crio 7346  (class class class)co 7390  1st c1st 7969  2nd c2nd 7970  Basecbs 17186  0gc0g 17409  -gcsg 18874  LSpanclspn 20884  HLchlt 39350  LHypclh 39985  DVecHcdvh 41079  LCDualclcd 41587  mapdcmpd 41625  HDMap1chdma1 41792
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-ot 4601  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-1st 7971  df-2nd 7972  df-hdmap1 41794
This theorem is referenced by:  hdmap1cl  41805  hdmap1eq2  41806  hdmap1eq4N  41807  hdmap1eulem  41823  hdmap1eulemOLDN  41824
  Copyright terms: Public domain W3C validator