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

Theorem cbvoprab1 7501
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 1947 . . . . . 6 𝑤 𝑣 = ⟨𝑥, 𝑦
2 cbvoprab1.1 . . . . . 6 𝑤𝜑
31, 2nfan 1932 . . . . 5 𝑤(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
43nfex 2354 . . . 4 𝑤𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
5 nfv 1947 . . . . . 6 𝑥 𝑣 = ⟨𝑤, 𝑦
6 cbvoprab1.2 . . . . . 6 𝑥𝜓
75, 6nfan 1932 . . . . 5 𝑥(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
87nfex 2354 . . . 4 𝑥𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
9 opeq1 4833 . . . . . . 7 (𝑥 = 𝑤 → ⟨𝑥, 𝑦⟩ = ⟨𝑤, 𝑦⟩)
109eqeq2d 2771 . . . . . 6 (𝑥 = 𝑤 → (𝑣 = ⟨𝑥, 𝑦⟩ ↔ 𝑣 = ⟨𝑤, 𝑦⟩))
11 cbvoprab1.3 . . . . . 6 (𝑥 = 𝑤 → (𝜑𝜓))
1210, 11anbi12d 644 . . . . 5 (𝑥 = 𝑤 → ((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
1312exbidv 1954 . . . 4 (𝑥 = 𝑤 → (∃𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
144, 8, 13cbvexv1 2371 . . 3 (∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓))
1514opabbii 5172 . 2 {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)}
16 dfoprab2 7472 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
17 dfoprab2 7472 . 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 1570  wex 1812  wnf 1816  cop 4590  {copab 5167  {coprab 7415
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-oprab 7418
This theorem is used by:  cbvmpo1  45931
  Copyright terms: Public domain W3C validator