Theorem cbvoprab12v 6101

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 1576	. 2 ⊢ Ⅎ𝑤𝜑
2		nfv 1576	. 2 ⊢ Ⅎ𝑣𝜑
3		nfv 1576	. 2 ⊢ Ⅎ𝑥𝜓
4		nfv 1576	. 2 ⊢ Ⅎ𝑦𝜓
5		cbvoprab12v.1	. 2 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝜑 ↔ 𝜓))
6	1, 2, 3, 4, 5	cbvoprab12 6100	1 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑣⟩, 𝑧⟩ ∣ 𝜓}

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

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1810  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-v 2803  df-un 3203  df-in 3205  df-ss 3212  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-opab 4152  df-oprab 6027

This theorem is referenced by: (None)