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 41904
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 6888 . . . . 5 (𝑓 = → (1st𝑓) = (1st))
32coeq1d 5852 . . . 4 (𝑓 = → ((1st𝑓) ∘ (1st𝑔)) = ((1st) ∘ (1st𝑔)))
4 fveq2 6888 . . . . 5 (𝑓 = → (2nd𝑓) = (2nd))
54oveq1d 7438 . . . 4 (𝑓 = → ((2nd𝑓) (2nd𝑔)) = ((2nd) (2nd𝑔)))
63, 5opeq12d 4851 . . 3 (𝑓 = → ⟨((1st𝑓) ∘ (1st𝑔)), ((2nd𝑓) (2nd𝑔))⟩ = ⟨((1st) ∘ (1st𝑔)), ((2nd) (2nd𝑔))⟩)
7 fveq2 6888 . . . . 5 (𝑔 = 𝑖 → (1st𝑔) = (1st𝑖))
87coeq2d 5853 . . . 4 (𝑔 = 𝑖 → ((1st) ∘ (1st𝑔)) = ((1st) ∘ (1st𝑖)))
9 fveq2 6888 . . . . 5 (𝑔 = 𝑖 → (2nd𝑔) = (2nd𝑖))
109oveq2d 7439 . . . 4 (𝑔 = 𝑖 → ((2nd) (2nd𝑔)) = ((2nd) (2nd𝑖)))
118, 10opeq12d 4851 . . 3 (𝑔 = 𝑖 → ⟨((1st) ∘ (1st𝑔)), ((2nd) (2nd𝑔))⟩ = ⟨((1st) ∘ (1st𝑖)), ((2nd) (2nd𝑖))⟩)
126, 11cbvmpov 7518 . 2 (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1st𝑓) ∘ (1st𝑔)), ((2nd𝑓) (2nd𝑔))⟩) = ( ∈ (𝑇 × 𝐸), 𝑖 ∈ (𝑇 × 𝐸) ↦ ⟨((1st) ∘ (1st𝑖)), ((2nd) (2nd𝑖))⟩)
131, 12eqtri 2789 1 + = ( ∈ (𝑇 × 𝐸), 𝑖 ∈ (𝑇 × 𝐸) ↦ ⟨((1st) ∘ (1st𝑖)), ((2nd) (2nd𝑖))⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  cop 4600   × cxp 5664  ccom 5670  cfv 6543  (class class class)co 7423  cmpo 7425  1st c1st 7993  2nd c2nd 7994
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-ext 2738
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-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-co 5675  df-iota 6499  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428
This theorem is used by:  dvhvaddval  41905
  Copyright terms: Public domain W3C validator