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

Theorem cbvoprab3 7541
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 1913 . . . . . 6 𝑤 𝑣 = ⟨𝑥, 𝑦
2 cbvoprab3.1 . . . . . 6 𝑤𝜑
31, 2nfan 1898 . . . . 5 𝑤(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
43nfex 2328 . . . 4 𝑤𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
54nfex 2328 . . 3 𝑤𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
6 nfv 1913 . . . . . 6 𝑧 𝑣 = ⟨𝑥, 𝑦
7 cbvoprab3.2 . . . . . 6 𝑧𝜓
86, 7nfan 1898 . . . . 5 𝑧(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
98nfex 2328 . . . 4 𝑧𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
109nfex 2328 . . 3 𝑧𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
11 cbvoprab3.3 . . . . 5 (𝑧 = 𝑤 → (𝜑𝜓))
1211anbi2d 629 . . . 4 (𝑧 = 𝑤 → ((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
13122exbidv 1923 . . 3 (𝑧 = 𝑤 → (∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
145, 10, 13cbvopab2 5243 . 2 {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑣, 𝑤⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
15 dfoprab2 7508 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
16 dfoprab2 7508 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ 𝜓} = {⟨𝑣, 𝑤⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
1714, 15, 163eqtr4i 2778 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ 𝜓}
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wex 1777  wnf 1781  cop 4654  {copab 5228  {coprab 7449
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-opab 5229  df-oprab 7452
This theorem is referenced by:  tposoprab  8303  erovlem  8871
  Copyright terms: Public domain W3C validator