MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbvoprab12v Structured version   Visualization version   GIF version

Theorem cbvoprab12v 6628
Description: Rule used to change first two bound variables in an operation abstraction, using implicit substitution. (Contributed by NM, 8-Oct-2004.)
Hypothesis
Ref Expression
cbvoprab12v.1 ((𝑥 = 𝑤𝑦 = 𝑣) → (𝜑𝜓))
Assertion
Ref Expression
cbvoprab12v {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑣⟩, 𝑧⟩ ∣ 𝜓}
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣   𝜑,𝑤,𝑣   𝜓,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑧,𝑤,𝑣)

Proof of Theorem cbvoprab12v
StepHypRef Expression
1 nfv 1830 . 2 𝑤𝜑
2 nfv 1830 . 2 𝑣𝜑
3 nfv 1830 . 2 𝑥𝜓
4 nfv 1830 . 2 𝑦𝜓
5 cbvoprab12v.1 . 2 ((𝑥 = 𝑤𝑦 = 𝑣) → (𝜑𝜓))
61, 2, 3, 4, 5cbvoprab12 6627 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑣⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  {coprab 6550
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-opab 4644  df-oprab 6553
This theorem is referenced by:  cpnnen  14797
  Copyright terms: Public domain W3C validator