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

Theorem cbvoprab3 7524
Description: Rule used to change the third bound variable in an operation abstraction, using implicit substitution. (Contributed by NM, 22-Aug-2013.)
Hypotheses
Ref Expression
cbvoprab3.1 𝑤𝜑
cbvoprab3.2 𝑧𝜓
cbvoprab3.3 (𝑧 = 𝑤 → (𝜑𝜓))
Assertion
Ref Expression
cbvoprab3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ 𝜓}
Distinct variable groups:   𝑥,𝑧,𝑤   𝑦,𝑧,𝑤
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝜓(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem cbvoprab3
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 nfv 1912 . . . . . 6 𝑤 𝑣 = ⟨𝑥, 𝑦
2 cbvoprab3.1 . . . . . 6 𝑤𝜑
31, 2nfan 1897 . . . . 5 𝑤(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
43nfex 2323 . . . 4 𝑤𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
54nfex 2323 . . 3 𝑤𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
6 nfv 1912 . . . . . 6 𝑧 𝑣 = ⟨𝑥, 𝑦
7 cbvoprab3.2 . . . . . 6 𝑧𝜓
86, 7nfan 1897 . . . . 5 𝑧(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
98nfex 2323 . . . 4 𝑧𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
109nfex 2323 . . 3 𝑧𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
11 cbvoprab3.3 . . . . 5 (𝑧 = 𝑤 → (𝜑𝜓))
1211anbi2d 630 . . . 4 (𝑧 = 𝑤 → ((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
13122exbidv 1922 . . 3 (𝑧 = 𝑤 → (∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
145, 10, 13cbvopab2 5225 . 2 {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑣, 𝑤⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
15 dfoprab2 7491 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
16 dfoprab2 7491 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ 𝜓} = {⟨𝑣, 𝑤⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
1714, 15, 163eqtr4i 2773 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ 𝜓}
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wex 1776  wnf 1780  cop 4637  {copab 5210  {coprab 7432
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-opab 5211  df-oprab 7435
This theorem is referenced by:  tposoprab  8286  erovlem  8852
  Copyright terms: Public domain W3C validator