Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > opabid2 | Structured version Visualization version GIF version |
Description: A relation expressed as an ordered pair abstraction. (Contributed by NM, 11-Dec-2006.) |
Ref | Expression |
---|---|
opabid2 | ⊢ (Rel 𝐴 → {〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 3402 | . . . 4 ⊢ 𝑧 ∈ V | |
2 | vex 3402 | . . . 4 ⊢ 𝑤 ∈ V | |
3 | opeq1 4770 | . . . . 5 ⊢ (𝑥 = 𝑧 → 〈𝑥, 𝑦〉 = 〈𝑧, 𝑦〉) | |
4 | 3 | eleq1d 2815 | . . . 4 ⊢ (𝑥 = 𝑧 → (〈𝑥, 𝑦〉 ∈ 𝐴 ↔ 〈𝑧, 𝑦〉 ∈ 𝐴)) |
5 | opeq2 4771 | . . . . 5 ⊢ (𝑦 = 𝑤 → 〈𝑧, 𝑦〉 = 〈𝑧, 𝑤〉) | |
6 | 5 | eleq1d 2815 | . . . 4 ⊢ (𝑦 = 𝑤 → (〈𝑧, 𝑦〉 ∈ 𝐴 ↔ 〈𝑧, 𝑤〉 ∈ 𝐴)) |
7 | 1, 2, 4, 6 | opelopab 5408 | . . 3 ⊢ (〈𝑧, 𝑤〉 ∈ {〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} ↔ 〈𝑧, 𝑤〉 ∈ 𝐴) |
8 | 7 | gen2 1804 | . 2 ⊢ ∀𝑧∀𝑤(〈𝑧, 𝑤〉 ∈ {〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} ↔ 〈𝑧, 𝑤〉 ∈ 𝐴) |
9 | relopabv 5676 | . . 3 ⊢ Rel {〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} | |
10 | eqrel 5640 | . . 3 ⊢ ((Rel {〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} ∧ Rel 𝐴) → ({〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} = 𝐴 ↔ ∀𝑧∀𝑤(〈𝑧, 𝑤〉 ∈ {〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} ↔ 〈𝑧, 𝑤〉 ∈ 𝐴))) | |
11 | 9, 10 | mpan 690 | . 2 ⊢ (Rel 𝐴 → ({〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} = 𝐴 ↔ ∀𝑧∀𝑤(〈𝑧, 𝑤〉 ∈ {〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} ↔ 〈𝑧, 𝑤〉 ∈ 𝐴))) |
12 | 8, 11 | mpbiri 261 | 1 ⊢ (Rel 𝐴 → {〈𝑥, 𝑦〉 ∣ 〈𝑥, 𝑦〉 ∈ 𝐴} = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∀wal 1541 = wceq 1543 ∈ wcel 2112 〈cop 4533 {copab 5101 Rel wrel 5541 |
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 2018 ax-8 2114 ax-9 2122 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pr 5307 |
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 2073 df-clab 2715 df-cleq 2728 df-clel 2809 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-opab 5102 df-xp 5542 df-rel 5543 |
This theorem is referenced by: opabbi2dv 5703 |
Copyright terms: Public domain | W3C validator |