MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbvopab1s Structured version   Visualization version   GIF version

Theorem cbvopab1s 4689
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.
StepHypRef Expression
1 nfv 1840 . . . 4 𝑧𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
2 nfv 1840 . . . . . 6 𝑥 𝑤 = ⟨𝑧, 𝑦
3 nfs1v 2436 . . . . . 6 𝑥[𝑧 / 𝑥]𝜑
42, 3nfan 1825 . . . . 5 𝑥(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)
54nfex 2151 . . . 4 𝑥𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)
6 opeq1 4372 . . . . . . 7 (𝑥 = 𝑧 → ⟨𝑥, 𝑦⟩ = ⟨𝑧, 𝑦⟩)
76eqeq2d 2631 . . . . . 6 (𝑥 = 𝑧 → (𝑤 = ⟨𝑥, 𝑦⟩ ↔ 𝑤 = ⟨𝑧, 𝑦⟩))
8 sbequ12 2108 . . . . . 6 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
97, 8anbi12d 746 . . . . 5 (𝑥 = 𝑧 → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)))
109exbidv 1847 . . . 4 (𝑥 = 𝑧 → (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)))
111, 5, 10cbvex 2271 . . 3 (∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑧𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑))
1211abbii 2736 . 2 {𝑤 ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {𝑤 ∣ ∃𝑧𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)}
13 df-opab 4676 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
14 df-opab 4676 . 2 {⟨𝑧, 𝑦⟩ ∣ [𝑧 / 𝑥]𝜑} = {𝑤 ∣ ∃𝑧𝑦(𝑤 = ⟨𝑧, 𝑦⟩ ∧ [𝑧 / 𝑥]𝜑)}
1512, 13, 143eqtr4i 2653 1 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑧, 𝑦⟩ ∣ [𝑧 / 𝑥]𝜑}
Colors of variables: wff setvar class
Syntax hints:  wa 384   = wceq 1480  wex 1701  [wsb 1877  {cab 2607  cop 4156  {copab 4674
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-rab 2916  df-v 3188  df-dif 3559  df-un 3561  df-in 3563  df-ss 3570  df-nul 3894  df-if 4061  df-sn 4151  df-pr 4153  df-op 4157  df-opab 4676
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator