| 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 1581 | . . . . 5 ⊢ Ⅎ𝑤 𝑢 = 〈𝑥, 𝑦〉 | |
| 2 | cbvoprab12.1 | . . . . 5 ⊢ Ⅎ𝑤𝜑 | |
| 3 | 1, 2 | nfan 1618 | . . . 4 ⊢ Ⅎ𝑤(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 4 | nfv 1581 | . . . . 5 ⊢ Ⅎ𝑣 𝑢 = 〈𝑥, 𝑦〉 | |
| 5 | cbvoprab12.2 | . . . . 5 ⊢ Ⅎ𝑣𝜑 | |
| 6 | 4, 5 | nfan 1618 | . . . 4 ⊢ Ⅎ𝑣(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 7 | nfv 1581 | . . . . 5 ⊢ Ⅎ𝑥 𝑢 = 〈𝑤, 𝑣〉 | |
| 8 | cbvoprab12.3 | . . . . 5 ⊢ Ⅎ𝑥𝜓 | |
| 9 | 7, 8 | nfan 1618 | . . . 4 ⊢ Ⅎ𝑥(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓) |
| 10 | nfv 1581 | . . . . 5 ⊢ Ⅎ𝑦 𝑢 = 〈𝑤, 𝑣〉 | |
| 11 | cbvoprab12.4 | . . . . 5 ⊢ Ⅎ𝑦𝜓 | |
| 12 | 10, 11 | nfan 1618 | . . . 4 ⊢ Ⅎ𝑦(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓) |
| 13 | opeq12 3901 | . . . . . 6 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → 〈𝑥, 𝑦〉 = 〈𝑤, 𝑣〉) | |
| 14 | 13 | eqeq2d 2250 | . . . . 5 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝑢 = 〈𝑥, 𝑦〉 ↔ 𝑢 = 〈𝑤, 𝑣〉)) |
| 15 | cbvoprab12.5 | . . . . 5 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → (𝜑 ↔ 𝜓)) | |
| 16 | 14, 15 | anbi12d 477 | . . . 4 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑣) → ((𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓))) |
| 17 | 3, 6, 9, 12, 16 | cbvex2 1978 | . . 3 ⊢ (∃𝑥∃𝑦(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑤∃𝑣(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓)) |
| 18 | 17 | opabbii 4193 | . 2 ⊢ {〈𝑢, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑)} = {〈𝑢, 𝑧〉 ∣ ∃𝑤∃𝑣(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓)} |
| 19 | dfoprab2 6125 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈𝑢, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑢 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
| 20 | dfoprab2 6125 | . 2 ⊢ {〈〈𝑤, 𝑣〉, 𝑧〉 ∣ 𝜓} = {〈𝑢, 𝑧〉 ∣ ∃𝑤∃𝑣(𝑢 = 〈𝑤, 𝑣〉 ∧ 𝜓)} | |
| 21 | 18, 19, 20 | 3eqtr4i 2269 | 1 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈〈𝑤, 𝑣〉, 𝑧〉 ∣ 𝜓} |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 Ⅎwnf 1513 ∃wex 1545 〈cop 3708 {copab 4186 {coprab 6076 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-opab 4188 df-oprab 6079 |
| This theorem is referenced by: cbvoprab12v 6153 cbvmpox 6156 dfoprab4f 6417 fmpox 6426 tposoprab 6541 |
| Copyright terms: Public domain | W3C validator |