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

Theorem cbvoprab12v 6772
 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 1883 . 2 𝑤𝜑
2 nfv 1883 . 2 𝑣𝜑
3 nfv 1883 . 2 𝑥𝜓
4 nfv 1883 . 2 𝑦𝜓
5 cbvoprab12v.1 . 2 ((𝑥 = 𝑤𝑦 = 𝑣) → (𝜑𝜓))
61, 2, 3, 4, 5cbvoprab12 6771 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑣⟩, 𝑧⟩ ∣ 𝜓}
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1523  {coprab 6691 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-opab 4746  df-oprab 6694 This theorem is referenced by:  cpnnen  15002
 Copyright terms: Public domain W3C validator