Theorem cbvopab1v 5221

Description: Rule used to change the first bound variable in an ordered pair abstraction, using implicit substitution. (Contributed by NM, 31-Jul-2003.) (Proof shortened by Eric Schmidt, 4-Apr-2007.) Reduce axiom usage. (Revised by GG, 17-Nov-2024.)

Hypothesis

Ref	Expression
cbvopab1v.1	⊢ (𝑥 = 𝑧 → (𝜑 ↔ 𝜓))

Assertion

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

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

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

Proof of Theorem cbvopab1v

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeq1 4873	. . . . . . 7 ⊢ (𝑥 = 𝑧 → ⟨𝑥, 𝑦⟩ = ⟨𝑧, 𝑦⟩)
2	1	eqeq2d 2748	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑤 = ⟨𝑥, 𝑦⟩ ↔ 𝑤 = ⟨𝑧, 𝑦⟩))
3		cbvopab1v.1	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ 𝜓))
4	2, 3	anbi12d 632	. . . . 5 ⊢ (𝑥 = 𝑧 → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑧, 𝑦⟩ ∧ 𝜓)))
5	4	exbidv 1921	. . . 4 ⊢ (𝑥 = 𝑧 → (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ 𝜓)))
6	5	cbvexvw 2036	. . 3 ⊢ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑧∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ 𝜓))
7	6	abbii 2809	. 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {𝑤 ∣ ∃𝑧∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ 𝜓)}
8		df-opab 5206	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
9		df-opab 5206	. 2 ⊢ {⟨𝑧, 𝑦⟩ ∣ 𝜓} = {𝑤 ∣ ∃𝑧∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ 𝜓)}
10	7, 8, 9	3eqtr4i 2775	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑧, 𝑦⟩ ∣ 𝜓}

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779  {cab 2714  ⟨cop 4632  {copab 5205

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-opab 5206

This theorem is referenced by:  cbvmptv  5255  cbvmptvw2  36235