| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opabresid | Structured version Visualization version GIF version | ||
| Description: The restricted identity relation expressed as an ordered-pair class abstraction. (Contributed by FL, 25-Apr-2012.) |
| Ref | Expression |
|---|---|
| opabresid | ⊢ ( I ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-id 5533 | . . . 4 ⊢ I = {〈𝑥, 𝑦〉 ∣ 𝑥 = 𝑦} | |
| 2 | equcom 2018 | . . . . 5 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥) | |
| 3 | 2 | opabbii 5174 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ 𝑥 = 𝑦} = {〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} |
| 4 | 1, 3 | eqtri 2752 | . . 3 ⊢ I = {〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} |
| 5 | 4 | reseq1i 5946 | . 2 ⊢ ( I ↾ 𝐴) = ({〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} ↾ 𝐴) |
| 6 | resopab 6005 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} | |
| 7 | 5, 6 | eqtri 2752 | 1 ⊢ ( I ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 = wceq 1540 ∈ wcel 2109 {copab 5169 I cid 5532 ↾ cres 5640 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-res 5650 |
| This theorem is referenced by: mptresid 6022 iresn0n0 6025 pospo 18304 eqg0subg 19128 opsrtoslem1 21962 tgphaus 24004 relexp0eq 43690 |
| Copyright terms: Public domain | W3C validator |