Theorem dvhfvsca 42077

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.

Step	Hyp	Ref	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‘𝐾)‘𝑊)
6	1, 2, 3, 4, 5	dvhset 42058	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝑈 = ({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st ‘𝑓) ∘ (1st ‘𝑔)), (ℎ ∈ 𝑇 ↦ (((2nd ‘𝑓)‘ℎ) ∘ ((2nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩)⟩}))
7	6	fveq2d 6877	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → ( ·𝑠 ‘𝑈) = ( ·𝑠 ‘({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st ‘𝑓) ∘ (1st ‘𝑔)), (ℎ ∈ 𝑇 ↦ (((2nd ‘𝑓)‘ℎ) ∘ ((2nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩)⟩})))
8		dvhfvsca.s	. 2 ⊢ · = ( ·𝑠 ‘𝑈)
9	3	fvexi 6887	. . . 4 ⊢ 𝐸 ∈ V
10	2	fvexi 6887	. . . . 5 ⊢ 𝑇 ∈ V
11	10, 9	xpex 7750	. . . 4 ⊢ (𝑇 × 𝐸) ∈ V
12	9, 11	mpoex 8075	. . 3 ⊢ (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩) ∈ V
13		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 ‘𝑓))⟩)⟩})
14	13	lmodvsca 17461	. . 3 ⊢ ((𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩) ∈ V → (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩) = ( ·𝑠 ‘({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st ‘𝑓) ∘ (1st ‘𝑔)), (ℎ ∈ 𝑇 ↦ (((2nd ‘𝑓)‘ℎ) ∘ ((2nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩)⟩})))
15	12, 14	ax-mp 5	. 2 ⊢ (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩) = ( ·𝑠 ‘({⟨(Base‘ndx), (𝑇 × 𝐸)⟩, ⟨(+g‘ndx), (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st ‘𝑓) ∘ (1st ‘𝑔)), (ℎ ∈ 𝑇 ↦ (((2nd ‘𝑓)‘ℎ) ∘ ((2nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), ((EDRing‘𝐾)‘𝑊)⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩)⟩}))
16	7, 8, 15	3eqtr4g 2820	1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → · = (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ∪ cun 3896  {csn 4583  {ctp 4587  ⟨cop 4589   ↦ cmpt 5185   × cxp 5645   ∘ ccom 5651  ‘cfv 6527   ∈ cmpo 7410  1^st c1st 7982  2^nd c2nd 7983  ndxcnx 17332  Basecbs 17348  +_gcplusg 17389  Scalarcsca 17392   ·_𝑠 cvsca 17393  LHypclh 40961  LTrncltrn 41078  TEndoctendo 41729  EDRingcedring 41730  DVecHcdvh 42055

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734  ax-cnex 11227  ax-resscn 11228  ax-1cn 11229  ax-icn 11230  ax-addcl 11231  ax-addrcl 11232  ax-mulcl 11233  ax-mulrcl 11234  ax-mulcom 11235  ax-addass 11236  ax-mulass 11237  ax-distr 11238  ax-i2m1 11239  ax-1ne0 11240  ax-1rid 11241  ax-rnegex 11242  ax-rrecex 11243  ax-cnre 11244  ax-pre-lttri 11245  ax-pre-lttrn 11246  ax-pre-ltadd 11247  ax-pre-mulgt0 11248

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8454  df-er 8695  df-en 8952  df-dom 8953  df-sdom 8954  df-fin 8955  df-pnf 11316  df-mnf 11317  df-xr 11318  df-ltxr 11319  df-le 11320  df-sub 11514  df-neg 11515  df-nn 12305  df-2 12374  df-3 12375  df-4 12376  df-5 12377  df-6 12378  df-n0 12576  df-z 12663  df-uz 12935  df-fz 13609  df-struct 17286  df-slot 17321  df-ndx 17333  df-base 17349  df-plusg 17402  df-sca 17405  df-vsca 17406  df-dvech 42056

This theorem is used by:  dvhvsca  42078