| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvoprab3 | Structured version Visualization version GIF version | ||
| Description: Rule used to change the third bound variable in an operation abstraction, using implicit substitution. (Contributed by NM, 22-Aug-2013.) |
| Ref | Expression |
|---|---|
| cbvoprab3.1 | ⊢ Ⅎ𝑤𝜑 |
| cbvoprab3.2 | ⊢ Ⅎ𝑧𝜓 |
| cbvoprab3.3 | ⊢ (𝑧 = 𝑤 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| cbvoprab3 | ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈〈𝑥, 𝑦〉, 𝑤〉 ∣ 𝜓} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1948 | . . . . . 6 ⊢ Ⅎ𝑤 𝑣 = 〈𝑥, 𝑦〉 | |
| 2 | cbvoprab3.1 | . . . . . 6 ⊢ Ⅎ𝑤𝜑 | |
| 3 | 1, 2 | nfan 1933 | . . . . 5 ⊢ Ⅎ𝑤(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 4 | 3 | nfex 2357 | . . . 4 ⊢ Ⅎ𝑤∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 5 | 4 | nfex 2357 | . . 3 ⊢ Ⅎ𝑤∃𝑥∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 6 | nfv 1948 | . . . . . 6 ⊢ Ⅎ𝑧 𝑣 = 〈𝑥, 𝑦〉 | |
| 7 | cbvoprab3.2 | . . . . . 6 ⊢ Ⅎ𝑧𝜓 | |
| 8 | 6, 7 | nfan 1933 | . . . . 5 ⊢ Ⅎ𝑧(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜓) |
| 9 | 8 | nfex 2357 | . . . 4 ⊢ Ⅎ𝑧∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜓) |
| 10 | 9 | nfex 2357 | . . 3 ⊢ Ⅎ𝑧∃𝑥∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜓) |
| 11 | cbvoprab3.3 | . . . . 5 ⊢ (𝑧 = 𝑤 → (𝜑 ↔ 𝜓)) | |
| 12 | 11 | anbi2d 642 | . . . 4 ⊢ (𝑧 = 𝑤 → ((𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜓))) |
| 13 | 12 | 2exbidv 1958 | . . 3 ⊢ (𝑧 = 𝑤 → (∃𝑥∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜓))) |
| 14 | 5, 10, 13 | cbvopab2 5183 | . 2 ⊢ {〈𝑣, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜑)} = {〈𝑣, 𝑤〉 ∣ ∃𝑥∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜓)} |
| 15 | dfoprab2 7485 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈𝑣, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
| 16 | dfoprab2 7485 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑤〉 ∣ 𝜓} = {〈𝑣, 𝑤〉 ∣ ∃𝑥∃𝑦(𝑣 = 〈𝑥, 𝑦〉 ∧ 𝜓)} | |
| 17 | 14, 15, 16 | 3eqtr4i 2796 | 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 4837 {copab 5169 {coprab 7428 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-pr 5394 |
| 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 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-opab 5170 df-oprab 7431 |
| This theorem is used by: tposoprab 8290 erovlem 8845 |
| Copyright terms: Public domain | W3C validator |