Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvopab2v | GIF version |
Description: Rule used to change the second bound variable in an ordered pair abstraction, using implicit substitution. (Contributed by NM, 2-Sep-1999.) |
Ref | Expression |
---|---|
cbvopab2v.1 | ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbvopab2v | ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑧〉 ∣ 𝜓} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opeq2 3701 | . . . . . . 7 ⊢ (𝑦 = 𝑧 → 〈𝑥, 𝑦〉 = 〈𝑥, 𝑧〉) | |
2 | 1 | eqeq2d 2149 | . . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑤 = 〈𝑥, 𝑦〉 ↔ 𝑤 = 〈𝑥, 𝑧〉)) |
3 | cbvopab2v.1 | . . . . . 6 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓)) | |
4 | 2, 3 | anbi12d 464 | . . . . 5 ⊢ (𝑦 = 𝑧 → ((𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓))) |
5 | 4 | cbvexv 1890 | . . . 4 ⊢ (∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)) |
6 | 5 | exbii 1584 | . . 3 ⊢ (∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)) |
7 | 6 | abbii 2253 | . 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)} |
8 | df-opab 3985 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
9 | df-opab 3985 | . 2 ⊢ {〈𝑥, 𝑧〉 ∣ 𝜓} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)} | |
10 | 7, 8, 9 | 3eqtr4i 2168 | 1 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑧〉 ∣ 𝜓} |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∃wex 1468 {cab 2123 〈cop 3525 {copab 3983 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-v 2683 df-un 3070 df-sn 3528 df-pr 3529 df-op 3531 df-opab 3985 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |