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

Theorem dvhvaddcbv 41113
Description: Change bound variables to isolate them later. (Contributed by NM, 3-Nov-2013.)
Hypothesis
Ref Expression
dvhvaddval.a + = (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), ((2nd𝑓) (2nd𝑔))⟩)
Assertion
Ref Expression
dvhvaddcbv + = ( ∈ (𝑇 × 𝐸), 𝑖 ∈ (𝑇 × 𝐸) ↦ ⟨((1st) ∘ (1st𝑖)), ((2nd) (2nd𝑖))⟩)
Distinct variable groups:   𝑓,𝑔,,𝑖,𝐸   ,𝑓,𝑔,,𝑖   𝑇,𝑓,𝑔,,𝑖
Allowed substitution hints:   + (𝑓,𝑔,,𝑖)

Proof of Theorem dvhvaddcbv
StepHypRef Expression
1 dvhvaddval.a . 2 + = (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), ((2nd𝑓) (2nd𝑔))⟩)
2 fveq2 6881 . . . . 5 (𝑓 = → (1st𝑓) = (1st))
32coeq1d 5846 . . . 4 (𝑓 = → ((1st𝑓) ∘ (1st𝑔)) = ((1st) ∘ (1st𝑔)))
4 fveq2 6881 . . . . 5 (𝑓 = → (2nd𝑓) = (2nd))
54oveq1d 7425 . . . 4 (𝑓 = → ((2nd𝑓) (2nd𝑔)) = ((2nd) (2nd𝑔)))
63, 5opeq12d 4862 . . 3 (𝑓 = → ⟨((1st𝑓) ∘ (1st𝑔)), ((2nd𝑓) (2nd𝑔))⟩ = ⟨((1st) ∘ (1st𝑔)), ((2nd) (2nd𝑔))⟩)
7 fveq2 6881 . . . . 5 (𝑔 = 𝑖 → (1st𝑔) = (1st𝑖))
87coeq2d 5847 . . . 4 (𝑔 = 𝑖 → ((1st) ∘ (1st𝑔)) = ((1st) ∘ (1st𝑖)))
9 fveq2 6881 . . . . 5 (𝑔 = 𝑖 → (2nd𝑔) = (2nd𝑖))
109oveq2d 7426 . . . 4 (𝑔 = 𝑖 → ((2nd) (2nd𝑔)) = ((2nd) (2nd𝑖)))
118, 10opeq12d 4862 . . 3 (𝑔 = 𝑖 → ⟨((1st) ∘ (1st𝑔)), ((2nd) (2nd𝑔))⟩ = ⟨((1st) ∘ (1st𝑖)), ((2nd) (2nd𝑖))⟩)
126, 11cbvmpov 7507 . 2 (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), ((2nd𝑓) (2nd𝑔))⟩) = ( ∈ (𝑇 × 𝐸), 𝑖 ∈ (𝑇 × 𝐸) ↦ ⟨((1st) ∘ (1st𝑖)), ((2nd) (2nd𝑖))⟩)
131, 12eqtri 2759 1 + = ( ∈ (𝑇 × 𝐸), 𝑖 ∈ (𝑇 × 𝐸) ↦ ⟨((1st) ∘ (1st𝑖)), ((2nd) (2nd𝑖))⟩)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1540  cop 4612   × cxp 5657  ccom 5663  cfv 6536  (class class class)co 7410  cmpo 7412  1st c1st 7991  2nd c2nd 7992
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-opab 5187  df-co 5668  df-iota 6489  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415
This theorem is referenced by:  dvhvaddval  41114
  Copyright terms: Public domain W3C validator