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

Theorem dvhfvsca 38355
 Description: Scalar product operation for the constructed full vector space H. (Contributed by NM, 2-Nov-2013.) (Revised by Mario Carneiro, 23-Jun-2014.)
Hypotheses
Ref Expression
dvhfvsca.h 𝐻 = (LHyp‘𝐾)
dvhfvsca.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
dvhfvsca.e 𝐸 = ((TEndo‘𝐾)‘𝑊)
dvhfvsca.u 𝑈 = ((DVecH‘𝐾)‘𝑊)
dvhfvsca.s · = ( ·𝑠𝑈)
Assertion
Ref Expression
dvhfvsca ((𝐾𝑉𝑊𝐻) → · = (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩))
Distinct variable groups:   𝑓,𝑠,𝐸   𝑓,𝐻   𝑓,𝐾,𝑠   𝑇,𝑓,𝑠   𝑓,𝑉   𝑓,𝑊,𝑠
Allowed substitution hints:   · (𝑓,𝑠)   𝑈(𝑓,𝑠)   𝐻(𝑠)   𝑉(𝑠)

Proof of Theorem dvhfvsca
Dummy variables 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dvhfvsca.h . . . 4 𝐻 = (LHyp‘𝐾)
2 dvhfvsca.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
3 dvhfvsca.e . . . 4 𝐸 = ((TEndo‘𝐾)‘𝑊)
4 eqid 2822 . . . 4 ((EDRing‘𝐾)‘𝑊) = ((EDRing‘𝐾)‘𝑊)
5 dvhfvsca.u . . . 4 𝑈 = ((DVecH‘𝐾)‘𝑊)
61, 2, 3, 4, 5dvhset 38336 . . 3 ((𝐾𝑉𝑊𝐻) → 𝑈 = ({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩}))
76fveq2d 6656 . 2 ((𝐾𝑉𝑊𝐻) → ( ·𝑠𝑈) = ( ·𝑠 ‘({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩})))
8 dvhfvsca.s . 2 · = ( ·𝑠𝑈)
93fvexi 6666 . . . 4 𝐸 ∈ V
102fvexi 6666 . . . . 5 𝑇 ∈ V
1110, 9xpex 7461 . . . 4 (𝑇 × 𝐸) ∈ V
129, 11mpoex 7764 . . 3 (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩) ∈ V
13 eqid 2822 . . . 4 ({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩}) = ({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩})
1413lmodvsca 16631 . . 3 ((𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩) ∈ V → (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩) = ( ·𝑠 ‘({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩})))
1512, 14ax-mp 5 . 2 (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩) = ( ·𝑠 ‘({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩}))
167, 8, 153eqtr4g 2882 1 ((𝐾𝑉𝑊𝐻) → · = (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2114  Vcvv 3469   ∪ cun 3906  {csn 4539  {ctp 4543  ⟨cop 4545   ↦ cmpt 5122   × cxp 5530   ∘ ccom 5536  ‘cfv 6334   ∈ cmpo 7142  1st c1st 7673  2nd c2nd 7674  ndxcnx 16471  Basecbs 16474  +gcplusg 16556  Scalarcsca 16559   ·𝑠 cvsca 16560  LHypclh 37239  LTrncltrn 37356  TEndoctendo 38007  EDRingcedring 38008  DVecHcdvh 38333 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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-rep 5166  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-nel 3116  df-ral 3135  df-rex 3136  df-reu 3137  df-rab 3139  df-v 3471  df-sbc 3748  df-csb 3856  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-tp 4544  df-op 4546  df-uni 4814  df-int 4852  df-iun 4896  df-br 5043  df-opab 5105  df-mpt 5123  df-tr 5149  df-id 5437  df-eprel 5442  df-po 5451  df-so 5452  df-fr 5491  df-we 5493  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-pred 6126  df-ord 6172  df-on 6173  df-lim 6174  df-suc 6175  df-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-f1 6339  df-fo 6340  df-f1o 6341  df-fv 6342  df-riota 7098  df-ov 7143  df-oprab 7144  df-mpo 7145  df-om 7566  df-1st 7675  df-2nd 7676  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-1o 8089  df-oadd 8093  df-er 8276  df-en 8497  df-dom 8498  df-sdom 8499  df-fin 8500  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-3 11689  df-4 11690  df-5 11691  df-6 11692  df-n0 11886  df-z 11970  df-uz 12232  df-fz 12886  df-struct 16476  df-ndx 16477  df-slot 16478  df-base 16480  df-plusg 16569  df-sca 16572  df-vsca 16573  df-dvech 38334 This theorem is referenced by:  dvhvsca  38356
 Copyright terms: Public domain W3C validator