dvhvscaval - Mathbox for Norm Megill

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

Theorem dvhvscaval 41562

Description: The scalar product operation for the constructed full vector space H. (Contributed by NM, 20-Nov-2013.)

**Hypothesis**
Ref	Expression
dvhvscaval.s	⊢ · = (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1^st ‘𝑓)), (𝑠 ∘ (2^nd ‘𝑓))⟩)

**Assertion**
Ref	Expression
dvhvscaval	⊢ ((𝑈 ∈ 𝐸 ∧ 𝐹 ∈ (𝑇 × 𝐸)) → (𝑈 · 𝐹) = ⟨(𝑈‘(1^st ‘𝐹)), (𝑈 ∘ (2^nd ‘𝐹))⟩)

Distinct variable groups: 𝑓,𝑠,𝐸 𝑇,𝑠,𝑓 Allowed substitution hints: · (𝑓,𝑠) 𝑈(𝑓,𝑠) 𝐹(𝑓,𝑠)

Proof of Theorem dvhvscaval Dummy variables 𝑡 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq1 6834	. . 3 ⊢ (𝑡 = 𝑈 → (𝑡‘(1^st ‘𝑔)) = (𝑈‘(1^st ‘𝑔)))
2		coeq1 5807	. . 3 ⊢ (𝑡 = 𝑈 → (𝑡 ∘ (2^nd ‘𝑔)) = (𝑈 ∘ (2^nd ‘𝑔)))
3	1, 2	opeq12d 4825	. 2 ⊢ (𝑡 = 𝑈 → ⟨(𝑡‘(1^st ‘𝑔)), (𝑡 ∘ (2^nd ‘𝑔))⟩ = ⟨(𝑈‘(1^st ‘𝑔)), (𝑈 ∘ (2^nd ‘𝑔))⟩)
4		2fveq3 6840	. . 3 ⊢ (𝑔 = 𝐹 → (𝑈‘(1^st ‘𝑔)) = (𝑈‘(1^st ‘𝐹)))
5		fveq2 6835	. . . 4 ⊢ (𝑔 = 𝐹 → (2^nd ‘𝑔) = (2^nd ‘𝐹))
6	5	coeq2d 5812	. . 3 ⊢ (𝑔 = 𝐹 → (𝑈 ∘ (2^nd ‘𝑔)) = (𝑈 ∘ (2^nd ‘𝐹)))
7	4, 6	opeq12d 4825	. 2 ⊢ (𝑔 = 𝐹 → ⟨(𝑈‘(1^st ‘𝑔)), (𝑈 ∘ (2^nd ‘𝑔))⟩ = ⟨(𝑈‘(1^st ‘𝐹)), (𝑈 ∘ (2^nd ‘𝐹))⟩)
8		dvhvscaval.s	. . 3 ⊢ · = (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1^st ‘𝑓)), (𝑠 ∘ (2^nd ‘𝑓))⟩)
9	8	dvhvscacbv 41561	. 2 ⊢ · = (𝑡 ∈ 𝐸, 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑡‘(1^st ‘𝑔)), (𝑡 ∘ (2^nd ‘𝑔))⟩)
10		opex 5412	. 2 ⊢ ⟨(𝑈‘(1^st ‘𝐹)), (𝑈 ∘ (2^nd ‘𝐹))⟩ ∈ V
11	3, 7, 9, 10	ovmpo 7521	1 ⊢ ((𝑈 ∈ 𝐸 ∧ 𝐹 ∈ (𝑇 × 𝐸)) → (𝑈 · 𝐹) = ⟨(𝑈‘(1^st ‘𝐹)), (𝑈 ∘ (2^nd ‘𝐹))⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ⟨cop 4574 × cxp 5623 ∘ ccom 5629 ‘cfv 6493 (class class class)co 7361 ∈ cmpo 7363 1^st c1st 7934 2^nd c2nd 7935

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-pr 5371

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-iota 6449 df-fun 6495 df-fv 6501 df-ov 7364 df-oprab 7365 df-mpo 7366

This theorem is referenced by: dvhvsca 41564 dvhopspN 41578

W3C validator