Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvopab2v | Structured version Visualization version 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 4785 | . . . . . . 7 ⊢ (𝑦 = 𝑧 → 〈𝑥, 𝑦〉 = 〈𝑥, 𝑧〉) | |
2 | 1 | eqeq2d 2748 | . . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑤 = 〈𝑥, 𝑦〉 ↔ 𝑤 = 〈𝑥, 𝑧〉)) |
3 | cbvopab2v.1 | . . . . . 6 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓)) | |
4 | 2, 3 | anbi12d 634 | . . . . 5 ⊢ (𝑦 = 𝑧 → ((𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓))) |
5 | 4 | cbvexvw 2045 | . . . 4 ⊢ (∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)) |
6 | 5 | exbii 1855 | . . 3 ⊢ (∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)) |
7 | 6 | abbii 2808 | . 2 ⊢ {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)} |
8 | df-opab 5116 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
9 | df-opab 5116 | . 2 ⊢ {〈𝑥, 𝑧〉 ∣ 𝜓} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = 〈𝑥, 𝑧〉 ∧ 𝜓)} | |
10 | 7, 8, 9 | 3eqtr4i 2775 | 1 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑥, 𝑧〉 ∣ 𝜓} |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1543 ∃wex 1787 {cab 2714 〈cop 4547 {copab 5115 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-ext 2708 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-sb 2071 df-clab 2715 df-cleq 2729 df-clel 2816 df-rab 3070 df-v 3410 df-dif 3869 df-un 3871 df-nul 4238 df-if 4440 df-sn 4542 df-pr 4544 df-op 4548 df-opab 5116 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |