Theorem cbvopab1s 4064

Description: Change first bound variable in an ordered-pair class abstraction, using explicit substitution. (Contributed by NM, 31-Jul-2003.)

Assertion

Ref	Expression
cbvopab1s	⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑧, 𝑦⟩ ∣ [𝑧 / 𝑥]𝜑}

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

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem cbvopab1s

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1521	. . . 4 ⊢ Ⅎ𝑧∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
2		nfv 1521	. . . . . 6 ⊢ Ⅎ𝑥 𝑤 = ⟨𝑧, 𝑦⟩
3		nfs1v 1932	. . . . . 6 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
4	2, 3	nfan 1558	. . . . 5 ⊢ Ⅎ𝑥(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)
5	4	nfex 1630	. . . 4 ⊢ Ⅎ𝑥∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)
6		opeq1 3765	. . . . . . 7 ⊢ (𝑥 = 𝑧 → ⟨𝑥, 𝑦⟩ = ⟨𝑧, 𝑦⟩)
7	6	eqeq2d 2182	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑤 = ⟨𝑥, 𝑦⟩ ↔ 𝑤 = ⟨𝑧, 𝑦⟩))
8		sbequ12 1764	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
9	7, 8	anbi12d 470	. . . . 5 ⊢ (𝑥 = 𝑧 → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)))
10	9	exbidv 1818	. . . 4 ⊢ (𝑥 = 𝑧 → (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)))
11	1, 5, 10	cbvex 1749	. . 3 ⊢ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑧∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑))
12	11	abbii 2286	. 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {𝑤 ∣ ∃𝑧∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)}
13		df-opab 4051	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
14		df-opab 4051	. 2 ⊢ {⟨𝑧, 𝑦⟩ ∣ [𝑧 / 𝑥]𝜑} = {𝑤 ∣ ∃𝑧∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)}
15	12, 13, 14	3eqtr4i 2201	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑧, 𝑦⟩ ∣ [𝑧 / 𝑥]𝜑}

Syntax hints:   ∧ wa 103   = wceq 1348  ∃wex 1485  [wsb 1755  {cab 2156  ⟨cop 3586  {copab 4049

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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732  df-un 3125  df-sn 3589  df-pr 3590  df-op 3592  df-opab 4051

This theorem is referenced by: (None)