| 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 5557 | . . . 4 ⊢ I = {〈𝑥, 𝑦〉 ∣ 𝑥 = 𝑦} | |
| 2 | equcom 2045 | . . . . 5 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥) | |
| 3 | 2 | opabbii 5182 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ 𝑥 = 𝑦} = {〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} |
| 4 | 1, 3 | eqtri 2792 | . . 3 ⊢ I = {〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} |
| 5 | 4 | reseq1i 5975 | . 2 ⊢ ( I ↾ 𝐴) = ({〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} ↾ 𝐴) |
| 6 | resopab 6037 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} | |
| 7 | 5, 6 | eqtri 2792 | 1 ⊢ ( I ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 400 = wceq 1567 ∈ wcel 2149 {copab 5177 I cid 5556 ↾ cres 5664 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 df-res 5674 |
| This theorem is referenced by: mptresid 6054 iresn0n0 6057 pospo 18399 eqg0subg 19267 opsrtoslem1 22175 tgphaus 24243 relexp0eq 44319 |
| Copyright terms: Public domain | W3C validator |