![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > cbvopab1s | GIF version |
Description: Change first bound variable in an ordered-pair class abstraction, using explicit substitution. (Contributed by NM, 31-Jul-2003.) |
Ref | Expression |
---|---|
cbvopab1s | ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑧, 𝑦〉 ∣ [𝑧 / 𝑥]𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1509 | . . . 4 ⊢ Ⅎ𝑧∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) | |
2 | nfv 1509 | . . . . . 6 ⊢ Ⅎ𝑥 𝑤 = 〈𝑧, 𝑦〉 | |
3 | nfs1v 1913 | . . . . . 6 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑 | |
4 | 2, 3 | nfan 1545 | . . . . 5 ⊢ Ⅎ𝑥(𝑤 = 〈𝑧, 𝑦〉 ∧ [𝑧 / 𝑥]𝜑) |
5 | 4 | nfex 1617 | . . . 4 ⊢ Ⅎ𝑥∃𝑦(𝑤 = 〈𝑧, 𝑦〉 ∧ [𝑧 / 𝑥]𝜑) |
6 | opeq1 3713 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → 〈𝑥, 𝑦〉 = 〈𝑧, 𝑦〉) | |
7 | 6 | eqeq2d 2152 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑤 = 〈𝑥, 𝑦〉 ↔ 𝑤 = 〈𝑧, 𝑦〉)) |
8 | sbequ12 1745 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑)) | |
9 | 7, 8 | anbi12d 465 | . . . . 5 ⊢ (𝑥 = 𝑧 → ((𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝑤 = 〈𝑧, 𝑦〉 ∧ [𝑧 / 𝑥]𝜑))) |
10 | 9 | exbidv 1798 | . . . 4 ⊢ (𝑥 = 𝑧 → (∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦(𝑤 = 〈𝑧, 𝑦〉 ∧ [𝑧 / 𝑥]𝜑))) |
11 | 1, 5, 10 | cbvex 1730 | . . 3 ⊢ (∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑧∃𝑦(𝑤 = 〈𝑧, 𝑦〉 ∧ [𝑧 / 𝑥]𝜑)) |
12 | 11 | abbii 2256 | . 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} = {𝑤 ∣ ∃𝑧∃𝑦(𝑤 = 〈𝑧, 𝑦〉 ∧ [𝑧 / 𝑥]𝜑)} |
13 | df-opab 3998 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
14 | df-opab 3998 | . 2 ⊢ {〈𝑧, 𝑦〉 ∣ [𝑧 / 𝑥]𝜑} = {𝑤 ∣ ∃𝑧∃𝑦(𝑤 = 〈𝑧, 𝑦〉 ∧ [𝑧 / 𝑥]𝜑)} | |
15 | 12, 13, 14 | 3eqtr4i 2171 | 1 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑧, 𝑦〉 ∣ [𝑧 / 𝑥]𝜑} |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 = wceq 1332 ∃wex 1469 [wsb 1736 {cab 2126 〈cop 3535 {copab 3996 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-v 2691 df-un 3080 df-sn 3538 df-pr 3539 df-op 3541 df-opab 3998 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |