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 41931

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 6884	. . 3 ⊢ (𝑡 = 𝑈 → (𝑡‘(1^st ‘𝑔)) = (𝑈‘(1^st ‘𝑔)))
2		coeq1 5845	. . 3 ⊢ (𝑡 = 𝑈 → (𝑡 ∘ (2^nd ‘𝑔)) = (𝑈 ∘ (2^nd ‘𝑔)))
3	1, 2	opeq12d 4848	. 2 ⊢ (𝑡 = 𝑈 → ⟨(𝑡‘(1^st ‘𝑔)), (𝑡 ∘ (2^nd ‘𝑔))⟩ = ⟨(𝑈‘(1^st ‘𝑔)), (𝑈 ∘ (2^nd ‘𝑔))⟩)
4		2fveq3 6890	. . 3 ⊢ (𝑔 = 𝐹 → (𝑈‘(1^st ‘𝑔)) = (𝑈‘(1^st ‘𝐹)))
5		fveq2 6885	. . . 4 ⊢ (𝑔 = 𝐹 → (2^nd ‘𝑔) = (2^nd ‘𝐹))
6	5	coeq2d 5850	. . 3 ⊢ (𝑔 = 𝐹 → (𝑈 ∘ (2^nd ‘𝑔)) = (𝑈 ∘ (2^nd ‘𝐹)))
7	4, 6	opeq12d 4848	. 2 ⊢ (𝑔 = 𝐹 → ⟨(𝑈‘(1^st ‘𝑔)), (𝑈 ∘ (2^nd ‘𝑔))⟩ = ⟨(𝑈‘(1^st ‘𝐹)), (𝑈 ∘ (2^nd ‘𝐹))⟩)
8		dvhvscaval.s	. . 3 ⊢ · = (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1^st ‘𝑓)), (𝑠 ∘ (2^nd ‘𝑓))⟩)
9	8	dvhvscacbv 41930	. 2 ⊢ · = (𝑡 ∈ 𝐸, 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑡‘(1^st ‘𝑔)), (𝑡 ∘ (2^nd ‘𝑔))⟩)
10		opex 5447	. 2 ⊢ ⟨(𝑈‘(1^st ‘𝐹)), (𝑈 ∘ (2^nd ‘𝐹))⟩ ∈ V
11	3, 7, 9, 10	ovmpo 7579	1 ⊢ ((𝑈 ∈ 𝐸 ∧ 𝐹 ∈ (𝑇 × 𝐸)) → (𝑈 · 𝐹) = ⟨(𝑈‘(1^st ‘𝐹)), (𝑈 ∘ (2^nd ‘𝐹))⟩)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ⟨cop 4597 × cxp 5661 ∘ ccom 5667 ‘cfv 6540 (class class class)co 7419 ∈ cmpo 7421 1^st c1st 7990 2^nd c2nd 7991

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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-pr 5406

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424

This theorem is used by: dvhvsca 41933 dvhopspN 41947

W3C validator