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

Theorem cbvoprab1 7511
Description: Rule used to change first bound variable in an operation abstraction, using implicit substitution. (Contributed by NM, 20-Dec-2008.) (Revised by Mario Carneiro, 5-Dec-2016.)
Hypotheses
Ref Expression
cbvoprab1.1 Ⅎ𝑤𝜑
cbvoprab1.2 Ⅎ𝑥𝜓
cbvoprab1.3 (𝑥 = 𝑤 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
cbvoprab1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Distinct variable group:   𝑥,𝑦,𝑧,𝑤
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤)   𝜓(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem cbvoprab1
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 nfv 1946 . . . . . 6 Ⅎ𝑤 𝑣 = ⟨𝑥, 𝑦⟩
2 cbvoprab1.1 . . . . . 6 Ⅎ𝑤𝜑
31, 2nfan 1931 . . . . 5 Ⅎ𝑤(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
43nfex 2354 . . . 4 Ⅎ𝑤∃𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
5 nfv 1946 . . . . . 6 Ⅎ𝑥 𝑣 = ⟨𝑤, 𝑦⟩
6 cbvoprab1.2 . . . . . 6 Ⅎ𝑥𝜓
75, 6nfan 1931 . . . . 5 Ⅎ𝑥(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
87nfex 2354 . . . 4 Ⅎ𝑥∃𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
9 opeq1 4839 . . . . . . 7 (𝑥 = 𝑤 → ⟨𝑥, 𝑦⟩ = ⟨𝑤, 𝑦⟩)
109eqeq2d 2771 . . . . . 6 (𝑥 = 𝑤 → (𝑣 = ⟨𝑥, 𝑦⟩ ↔ 𝑣 = ⟨𝑤, 𝑦⟩))
11 cbvoprab1.3 . . . . . 6 (𝑥 = 𝑤 → (𝜑 ↔ 𝜓))
1210, 11anbi12d 644 . . . . 5 (𝑥 = 𝑤 → ((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
1312exbidv 1953 . . . 4 (𝑥 = 𝑤 → (∃𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
144, 8, 13cbvexv1 2371 . . 3 (∃𝑥∃𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑤∃𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓))
1514opabbii 5171 . 2 {⟨𝑣, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑤∃𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)}
16 dfoprab2 7482 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
17 dfoprab2 7482 . 2 {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑤∃𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)}
1815, 16, 173eqtr4i 2793 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811  Ⅎwnf 1815  ⟨cop 4834  {copab 5166  {coprab 7425
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-opab 5167  df-oprab 7428
This theorem is used by:  cbvmpo1  46249
  Copyright terms: Public domain W3C validator