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

Theorem cbvoprab3 7447
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 1921 . . . . . 6 𝑤 𝑣 = ⟨𝑥, 𝑦
2 cbvoprab3.1 . . . . . 6 𝑤𝜑
31, 2nfan 1906 . . . . 5 𝑤(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
43nfex 2333 . . . 4 𝑤𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
54nfex 2333 . . 3 𝑤𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
6 nfv 1921 . . . . . 6 𝑧 𝑣 = ⟨𝑥, 𝑦
7 cbvoprab3.2 . . . . . 6 𝑧𝜓
86, 7nfan 1906 . . . . 5 𝑧(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
98nfex 2333 . . . 4 𝑧𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
109nfex 2333 . . 3 𝑧𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
11 cbvoprab3.3 . . . . 5 (𝑧 = 𝑤 → (𝜑𝜓))
1211anbi2d 636 . . . 4 (𝑧 = 𝑤 → ((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
13122exbidv 1931 . . 3 (𝑧 = 𝑤 → (∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
145, 10, 13cbvopab2 5148 . 2 {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑣, 𝑤⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
15 dfoprab2 7414 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
16 dfoprab2 7414 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ 𝜓} = {⟨𝑣, 𝑤⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
1714, 15, 163eqtr4i 2772 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ 𝜓}
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wex 1786  wnf 1790  cop 4561  {copab 5134  {coprab 7357
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-opab 5135  df-oprab 7360
This theorem is referenced by:  tposoprab  8202  erovlem  8750
  Copyright terms: Public domain W3C validator