![]() |
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 3805 | . . . . . . 7 ⊢ (𝑦 = 𝑧 → 〈𝑥, 𝑦〉 = 〈𝑥, 𝑧〉) | |
2 | 1 | eqeq2d 2205 | . . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑤 = 〈𝑥, 𝑦〉 ↔ 𝑤 = 〈𝑥, 𝑧〉)) |
3 | cbvopab2v.1 | . . . . . 6 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓)) | |
4 | 2, 3 | anbi12d 473 | . . . . 5 ⊢ (𝑦 = 𝑧 → ((𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓))) |
5 | 4 | cbvexv 1930 | . . . 4 ⊢ (∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)) |
6 | 5 | exbii 1616 | . . 3 ⊢ (∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)) |
7 | 6 | abbii 2309 | . 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)} |
8 | df-opab 4091 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
9 | df-opab 4091 | . 2 ⊢ {〈𝑥, 𝑧〉 ∣ 𝜓} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)} | |
10 | 7, 8, 9 | 3eqtr4i 2224 | 1 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑧〉 ∣ 𝜓} |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∃wex 1503 {cab 2179 〈cop 3621 {copab 4089 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2175 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-v 2762 df-un 3157 df-sn 3624 df-pr 3625 df-op 3627 df-opab 4091 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |