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

Theorem cbvoprab12 7509
Description: Rule used to change first two bound variables in an operation abstraction, using implicit substitution. (Contributed by NM, 21-Feb-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Hypotheses
Ref Expression
cbvoprab12.1 Ⅎ𝑤𝜑
cbvoprab12.2 Ⅎ𝑣𝜑
cbvoprab12.3 Ⅎ𝑥𝜓
cbvoprab12.4 Ⅎ𝑦𝜓
cbvoprab12.5 ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
cbvoprab12 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑣⟩, 𝑧⟩ ∣ 𝜓}
Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝑣
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤, 𝑣)   𝜓(𝑥, 𝑦, 𝑧, 𝑤, 𝑣)

Proof of Theorem cbvoprab12
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 nfv 1947 . . . . 5 Ⅎ𝑤 𝑢 = ⟨𝑥, 𝑦⟩
2 cbvoprab12.1 . . . . 5 Ⅎ𝑤𝜑
31, 2nfan 1932 . . . 4 Ⅎ𝑤(𝑢 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
4 nfv 1947 . . . . 5 Ⅎ𝑣 𝑢 = ⟨𝑥, 𝑦⟩
5 cbvoprab12.2 . . . . 5 Ⅎ𝑣𝜑
64, 5nfan 1932 . . . 4 Ⅎ𝑣(𝑢 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
7 nfv 1947 . . . . 5 Ⅎ𝑥 𝑢 = ⟨𝑤, 𝑣⟩
8 cbvoprab12.3 . . . . 5 Ⅎ𝑥𝜓
97, 8nfan 1932 . . . 4 Ⅎ𝑥(𝑢 = ⟨𝑤, 𝑣⟩ ∧ 𝜓)
10 nfv 1947 . . . . 5 Ⅎ𝑦 𝑢 = ⟨𝑤, 𝑣⟩
11 cbvoprab12.4 . . . . 5 Ⅎ𝑦𝜓
1210, 11nfan 1932 . . . 4 Ⅎ𝑦(𝑢 = ⟨𝑤, 𝑣⟩ ∧ 𝜓)
13 opeq12 4835 . . . . . 6 ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → ⟨𝑥, 𝑦⟩ = ⟨𝑤, 𝑣⟩)
1413eqeq2d 2772 . . . . 5 ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝑢 = ⟨𝑥, 𝑦⟩ ↔ 𝑢 = ⟨𝑤, 𝑣⟩))
15 cbvoprab12.5 . . . . 5 ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝜑 ↔ 𝜓))
1614, 15anbi12d 644 . . . 4 ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → ((𝑢 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑢 = ⟨𝑤, 𝑣⟩ ∧ 𝜓)))
173, 6, 9, 12, 16cbvex2v 2374 . . 3 (∃𝑥∃𝑦(𝑢 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑤∃𝑣(𝑢 = ⟨𝑤, 𝑣⟩ ∧ 𝜓))
1817opabbii 5172 . 2 {⟨𝑢, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑢 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑢, 𝑧⟩ ∣ ∃𝑤∃𝑣(𝑢 = ⟨𝑤, 𝑣⟩ ∧ 𝜓)}
19 dfoprab2 7478 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑢, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑢 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
20 dfoprab2 7478 . 2 {⟨⟨𝑤, 𝑣⟩, 𝑧⟩ ∣ 𝜓} = {⟨𝑢, 𝑧⟩ ∣ ∃𝑤∃𝑣(𝑢 = ⟨𝑤, 𝑣⟩ ∧ 𝜓)}
2118, 19, 203eqtr4i 2794 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 7421
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 2733  ax-sep 5249  ax-pr 5391
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 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  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 7424
This theorem is used by:  cbvmpox  7513  dfoprab4f  8067  fmpox  8078  tposoprab  8279  f1od2  33311  cbvmpox2  49447
  Copyright terms: Public domain W3C validator