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

Theorem dvhopspN 42363
Description: Scalar product of DVecH vector expressed as ordered pair. (Contributed by NM, 20-Nov-2013.) (New usage is discouraged.)
Hypothesis
Ref Expression
dvhopsp.s 𝑆 = (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩)
Assertion
Ref Expression
dvhopspN ((𝑅 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸)) → (𝑅𝑆⟨𝐹, 𝑈⟩) = ⟨(𝑅‘𝐹), (𝑅 ∘ 𝑈)⟩)
Distinct variable groups:   𝑓,𝑠,𝐸   𝑇,𝑓,𝑠
Allowed substitution hints:   𝑅(𝑓, 𝑠)   𝑆(𝑓, 𝑠)   𝑈(𝑓, 𝑠)   𝐹(𝑓, 𝑠)

Proof of Theorem dvhopspN
StepHypRef Expression
1 opelxpi 5692 . . 3 ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → ⟨𝐹, 𝑈⟩ ∈ (𝑇 × 𝐸))
2 dvhopsp.s . . . 4 𝑆 = (𝑠 ∈ 𝐸, 𝑓 ∈ (𝑇 × 𝐸) ↦ ⟨(𝑠‘(1st ‘𝑓)), (𝑠 ∘ (2nd ‘𝑓))⟩)
32dvhvscaval 42347 . . 3 ((𝑅 ∈ 𝐸 ∧ ⟨𝐹, 𝑈⟩ ∈ (𝑇 × 𝐸)) → (𝑅𝑆⟨𝐹, 𝑈⟩) = ⟨(𝑅‘(1st ‘⟨𝐹, 𝑈⟩)), (𝑅 ∘ (2nd ‘⟨𝐹, 𝑈⟩))⟩)
41, 3sylan2 605 . 2 ((𝑅 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸)) → (𝑅𝑆⟨𝐹, 𝑈⟩) = ⟨(𝑅‘(1st ‘⟨𝐹, 𝑈⟩)), (𝑅 ∘ (2nd ‘⟨𝐹, 𝑈⟩))⟩)
5 op1stg 8034 . . . . 5 ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → (1st ‘⟨𝐹, 𝑈⟩) = 𝐹)
65fveq2d 6909 . . . 4 ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → (𝑅‘(1st ‘⟨𝐹, 𝑈⟩)) = (𝑅‘𝐹))
7 op2ndg 8035 . . . . 5 ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → (2nd ‘⟨𝐹, 𝑈⟩) = 𝑈)
87coeq2d 5845 . . . 4 ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → (𝑅 ∘ (2nd ‘⟨𝐹, 𝑈⟩)) = (𝑅 ∘ 𝑈))
96, 8opeq12d 4851 . . 3 ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → ⟨(𝑅‘(1st ‘⟨𝐹, 𝑈⟩)), (𝑅 ∘ (2nd ‘⟨𝐹, 𝑈⟩))⟩ = ⟨(𝑅‘𝐹), (𝑅 ∘ 𝑈)⟩)
109adantl 487 . 2 ((𝑅 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸)) → ⟨(𝑅‘(1st ‘⟨𝐹, 𝑈⟩)), (𝑅 ∘ (2nd ‘⟨𝐹, 𝑈⟩))⟩ = ⟨(𝑅‘𝐹), (𝑅 ∘ 𝑈)⟩)
114, 10eqtrd 2798 1 ((𝑅 ∈ 𝐸 ∧ (𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸)) → (𝑅𝑆⟨𝐹, 𝑈⟩) = ⟨(𝑅‘𝐹), (𝑅 ∘ 𝑈)⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟨cop 4838   × cxp 5653   ∘ ccom 5659  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442  1st c1st 8020  2nd c2nd 8021
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023
This theorem is used by:  dvhopN  42364
  Copyright terms: Public domain W3C validator