Theorem cbvopab2v 4137

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 3834	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝑧⟩)
2	1	eqeq2d 2219	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑤 = ⟨𝑥, 𝑦⟩ ↔ 𝑤 = ⟨𝑥, 𝑧⟩))
3		cbvopab2v.1	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))
4	2, 3	anbi12d 473	. . . . 5 ⊢ (𝑦 = 𝑧 → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓)))
5	4	cbvexv 1943	. . . 4 ⊢ (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓))
6	5	exbii 1629	. . 3 ⊢ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓))
7	6	abbii 2323	. 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓)}
8		df-opab 4122	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
9		df-opab 4122	. 2 ⊢ {⟨𝑥, 𝑧⟩ ∣ 𝜓} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝜓)}
10	7, 8, 9	3eqtr4i 2238	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑧⟩ ∣ 𝜓}

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1373  ∃wex 1516  {cab 2193  ⟨cop 3646  {copab 4120

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-un 3178  df-sn 3649  df-pr 3650  df-op 3652  df-opab 4122

This theorem is referenced by: (None)