Theorem cbvopab2v 4059

Description: Rule used to change the second bound variable in an ordered pair abstraction, using implicit substitution. (Contributed by NM, 2-Sep-1999.)

Hypothesis

Ref	Expression
cbvopab2v.1	⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvopab2v	⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑧⟩ ∣ 𝜓}

Distinct variable groups:   𝑥,𝑦,𝑧   𝜑,𝑧   𝜓,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑧)

Proof of Theorem cbvopab2v

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeq2 3759	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝑧⟩)
2	1	eqeq2d 2177	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑤 = ⟨𝑥, 𝑦⟩ ↔ 𝑤 = ⟨𝑥, 𝑧⟩))
3		cbvopab2v.1	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))
4	2, 3	anbi12d 465	. . . . 5 ⊢ (𝑦 = 𝑧 → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓)))
5	4	cbvexv 1906	. . . 4 ⊢ (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓))
6	5	exbii 1593	. . 3 ⊢ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓))
7	6	abbii 2282	. 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓)}
8		df-opab 4044	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
9		df-opab 4044	. 2 ⊢ {⟨𝑥, 𝑧⟩ ∣ 𝜓} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓)}
10	7, 8, 9	3eqtr4i 2196	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑧⟩ ∣ 𝜓}

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1343  ∃wex 1480  {cab 2151  ⟨cop 3579  {copab 4042

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728  df-un 3120  df-sn 3582  df-pr 3583  df-op 3585  df-opab 4044

This theorem is referenced by: (None)