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

Theorem dvhfvsca 36909
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 2760 . . . 4 ((EDRing‘𝐾)‘𝑊) = ((EDRing‘𝐾)‘𝑊)
5 dvhfvsca.u . . . 4 𝑈 = ((DVecH‘𝐾)‘𝑊)
61, 2, 3, 4, 5dvhset 36890 . . 3 ((𝐾𝑉𝑊𝐻) → 𝑈 = ({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩}))
76fveq2d 6357 . 2 ((𝐾𝑉𝑊𝐻) → ( ·𝑠𝑈) = ( ·𝑠 ‘({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩})))
8 dvhfvsca.s . 2 · = ( ·𝑠𝑈)
9 fvex 6363 . . . . 5 ((TEndo‘𝐾)‘𝑊) ∈ V
103, 9eqeltri 2835 . . . 4 𝐸 ∈ V
11 fvex 6363 . . . . . 6 ((LTrn‘𝐾)‘𝑊) ∈ V
122, 11eqeltri 2835 . . . . 5 𝑇 ∈ V
1312, 10xpex 7128 . . . 4 (𝑇 × 𝐸) ∈ V
1410, 13mpt2ex 7416 . . 3 (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩) ∈ V
15 eqid 2760 . . . 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𝑓))⟩)⟩})
1615lmodvsca 16243 . . 3 ((𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩) ∈ V → (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩) = ( ·𝑠 ‘({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩})))
1714, 16ax-mp 5 . 2 (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩) = ( ·𝑠 ‘({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), (𝑇 ↦ (((2nd𝑓)‘) ∘ ((2nd𝑔)‘)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩)⟩}))
187, 8, 173eqtr4g 2819 1 ((𝐾𝑉𝑊𝐻) → · = (𝑠𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st𝑓)), (𝑠 ∘ (2nd𝑓))⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1632  wcel 2139  Vcvv 3340  cun 3713  {csn 4321  {ctp 4325  cop 4327  cmpt 4881   × cxp 5264  ccom 5270  cfv 6049  cmpt2 6816  1st c1st 7332  2nd c2nd 7333  ndxcnx 16076  Basecbs 16079  +gcplusg 16163  Scalarcsca 16166   ·𝑠 cvsca 16167  LHypclh 35791  LTrncltrn 35908  TEndoctendo 36560  EDRingcedring 36561  DVecHcdvh 36887
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7115  ax-cnex 10204  ax-resscn 10205  ax-1cn 10206  ax-icn 10207  ax-addcl 10208  ax-addrcl 10209  ax-mulcl 10210  ax-mulrcl 10211  ax-mulcom 10212  ax-addass 10213  ax-mulass 10214  ax-distr 10215  ax-i2m1 10216  ax-1ne0 10217  ax-1rid 10218  ax-rnegex 10219  ax-rrecex 10220  ax-cnre 10221  ax-pre-lttri 10222  ax-pre-lttrn 10223  ax-pre-ltadd 10224  ax-pre-mulgt0 10225
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-int 4628  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-riota 6775  df-ov 6817  df-oprab 6818  df-mpt2 6819  df-om 7232  df-1st 7334  df-2nd 7335  df-wrecs 7577  df-recs 7638  df-rdg 7676  df-1o 7730  df-oadd 7734  df-er 7913  df-en 8124  df-dom 8125  df-sdom 8126  df-fin 8127  df-pnf 10288  df-mnf 10289  df-xr 10290  df-ltxr 10291  df-le 10292  df-sub 10480  df-neg 10481  df-nn 11233  df-2 11291  df-3 11292  df-4 11293  df-5 11294  df-6 11295  df-n0 11505  df-z 11590  df-uz 11900  df-fz 12540  df-struct 16081  df-ndx 16082  df-slot 16083  df-base 16085  df-plusg 16176  df-sca 16179  df-vsca 16180  df-dvech 36888
This theorem is referenced by:  dvhvsca  36910
  Copyright terms: Public domain W3C validator