| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvoprab12 | GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| cbvoprab12.1 | ⊢ Ⅎ𝑤𝜑 |
| cbvoprab12.2 | ⊢ Ⅎ𝑣𝜑 |
| cbvoprab12.3 | ⊢ Ⅎ𝑥𝜓 |
| cbvoprab12.4 | ⊢ Ⅎ𝑦𝜓 |
| cbvoprab12.5 | ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| cbvoprab12 | ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈〈𝑤, 𝑣〉, 𝑧〉 ∣ 𝜓} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1574 | . . . . 5 ⊢ Ⅎ𝑤 𝑢 = 〈𝑥, 𝑦〉 | |
| 2 | cbvoprab12.1 | . . . . 5 ⊢ Ⅎ𝑤𝜑 | |
| 3 | 1, 2 | nfan 1611 | . . . 4 ⊢ Ⅎ𝑤(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 4 | nfv 1574 | . . . . 5 ⊢ Ⅎ𝑣 𝑢 = 〈𝑥, 𝑦〉 | |
| 5 | cbvoprab12.2 | . . . . 5 ⊢ Ⅎ𝑣𝜑 | |
| 6 | 4, 5 | nfan 1611 | . . . 4 ⊢ Ⅎ𝑣(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 7 | nfv 1574 | . . . . 5 ⊢ Ⅎ𝑥 𝑢 = 〈𝑤, 𝑣〉 | |
| 8 | cbvoprab12.3 | . . . . 5 ⊢ Ⅎ𝑥𝜓 | |
| 9 | 7, 8 | nfan 1611 | . . . 4 ⊢ Ⅎ𝑥(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓) |
| 10 | nfv 1574 | . . . . 5 ⊢ Ⅎ𝑦 𝑢 = 〈𝑤, 𝑣〉 | |
| 11 | cbvoprab12.4 | . . . . 5 ⊢ Ⅎ𝑦𝜓 | |
| 12 | 10, 11 | nfan 1611 | . . . 4 ⊢ Ⅎ𝑦(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓) |
| 13 | opeq12 3858 | . . . . . 6 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → 〈𝑥, 𝑦〉 = 〈𝑤, 𝑣〉) | |
| 14 | 13 | eqeq2d 2241 | . . . . 5 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝑢 = 〈𝑥, 𝑦〉 ↔ 𝑢 = 〈𝑤, 𝑣〉)) |
| 15 | cbvoprab12.5 | . . . . 5 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝜑 ↔ 𝜓)) | |
| 16 | 14, 15 | anbi12d 473 | . . . 4 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → ((𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓))) |
| 17 | 3, 6, 9, 12, 16 | cbvex2 1969 | . . 3 ⊢ (∃𝑥∃𝑦(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑤∃𝑣(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓)) |
| 18 | 17 | opabbii 4150 | . 2 ⊢ {〈𝑢, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑)} = {〈𝑢, 𝑧〉 ∣ ∃𝑤∃𝑣(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓)} |
| 19 | dfoprab2 6050 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈𝑢, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
| 20 | dfoprab2 6050 | . 2 ⊢ {〈〈𝑤, 𝑣〉, 𝑧〉 ∣ 𝜓} = {〈𝑢, 𝑧〉 ∣ ∃𝑤∃𝑣(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓)} | |
| 21 | 18, 19, 20 | 3eqtr4i 2260 | 1 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈〈𝑤, 𝑣〉, 𝑧〉 ∣ 𝜓} |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 Ⅎwnf 1506 ∃wex 1538 〈cop 3669 {copab 4143 {coprab 6001 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-opab 4145 df-oprab 6004 |
| This theorem is referenced by: cbvoprab12v 6078 cbvmpox 6081 dfoprab4f 6337 fmpox 6344 tposoprab 6424 |
| Copyright terms: Public domain | W3C validator |