Theorem cbvoprab12v 5997

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

Step	Hyp	Ref	Expression
1		nfv 1542	. 2 ⊢ Ⅎ𝑤𝜑
2		nfv 1542	. 2 ⊢ Ⅎ𝑣𝜑
3		nfv 1542	. 2 ⊢ Ⅎ𝑥𝜓
4		nfv 1542	. 2 ⊢ Ⅎ𝑦𝜓
5		cbvoprab12v.1	. 2 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝜑 ↔ 𝜓))
6	1, 2, 3, 4, 5	cbvoprab12 5996	1 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑣⟩, 𝑧⟩ ∣ 𝜓}

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364  {coprab 5923

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-opab 4095  df-oprab 5926

This theorem is referenced by: (None)