Theorem cbvopab2v 5146

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 4806	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝑧⟩)
2	1	eqeq2d 2834	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑤 = ⟨𝑥, 𝑦⟩ ↔ 𝑤 = ⟨𝑥, 𝑧⟩))
3		cbvopab2v.1	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))
4	2, 3	anbi12d 632	. . . . 5 ⊢ (𝑦 = 𝑧 → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓)))
5	4	cbvexvw 2044	. . . 4 ⊢ (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓))
6	5	exbii 1848	. . 3 ⊢ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓))
7	6	abbii 2888	. 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓)}
8		df-opab 5131	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
9		df-opab 5131	. 2 ⊢ {⟨𝑥, 𝑧⟩ ∣ 𝜓} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓)}
10	7, 8, 9	3eqtr4i 2856	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑧⟩ ∣ 𝜓}

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537  ∃wex 1780  {cab 2801  ⟨cop 4575  {copab 5130

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-opab 5131

This theorem is referenced by: (None)