![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > opabbid | Structured version Visualization version GIF version |
Description: Equivalent wff's yield equal ordered-pair class abstractions (deduction form). (Contributed by NM, 21-Feb-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) |
Ref | Expression |
---|---|
opabbid.1 | ⊢ Ⅎ𝑥𝜑 |
opabbid.2 | ⊢ Ⅎ𝑦𝜑 |
opabbid.3 | ⊢ (𝜑 → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
opabbid | ⊢ (𝜑 → {〈𝑥, 𝑦〉 ∣ 𝜓} = {〈𝑥, 𝑦〉 ∣ 𝜒}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opabbid.1 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
2 | opabbid.2 | . . . . 5 ⊢ Ⅎ𝑦𝜑 | |
3 | opabbid.3 | . . . . . 6 ⊢ (𝜑 → (𝜓 ↔ 𝜒)) | |
4 | 3 | anbi2d 629 | . . . . 5 ⊢ (𝜑 → ((𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜒))) |
5 | 2, 4 | exbid 2216 | . . . 4 ⊢ (𝜑 → (∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ ∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜒))) |
6 | 1, 5 | exbid 2216 | . . 3 ⊢ (𝜑 → (∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜒))) |
7 | 6 | abbidv 2800 | . 2 ⊢ (𝜑 → {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜓)} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜒)}) |
8 | df-opab 5195 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜓} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜓)} | |
9 | df-opab 5195 | . 2 ⊢ {〈𝑥, 𝑦〉 ∣ 𝜒} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜒)} | |
10 | 7, 8, 9 | 3eqtr4g 2796 | 1 ⊢ (𝜑 → {〈𝑥, 𝑦〉 ∣ 𝜓} = {〈𝑥, 𝑦〉 ∣ 𝜒}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∃wex 1781 Ⅎwnf 1785 {cab 2708 〈cop 4619 {copab 5194 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-9 2116 ax-12 2171 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1782 df-nf 1786 df-sb 2068 df-clab 2709 df-cleq 2723 df-opab 5195 |
This theorem is referenced by: mpteq12da 5217 mpteq12dfOLD 5219 mpteq12f 5220 feqmptdf 6939 fnoprabg 7506 sprsymrelfo 45849 |
Copyright terms: Public domain | W3C validator |