![]() |
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 5593 | . . . 4 ⊢ I = {〈𝑥, 𝑦〉 ∣ 𝑥 = 𝑦} | |
2 | equcom 2017 | . . . . 5 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥) | |
3 | 2 | opabbii 5233 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ 𝑥 = 𝑦} = {〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} |
4 | 1, 3 | eqtri 2768 | . . 3 ⊢ I = {〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} |
5 | 4 | reseq1i 6005 | . 2 ⊢ ( I ↾ 𝐴) = ({〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} ↾ 𝐴) |
6 | resopab 6063 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝑦 = 𝑥} ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} | |
7 | 5, 6 | eqtri 2768 | 1 ⊢ ( I ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 395 = wceq 1537 ∈ wcel 2108 {copab 5228 I cid 5592 ↾ cres 5702 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-opab 5229 df-id 5593 df-xp 5706 df-rel 5707 df-res 5712 |
This theorem is referenced by: mptresid 6080 iresn0n0 6083 pospo 18415 eqg0subg 19236 opsrtoslem1 22102 tgphaus 24146 relexp0eq 43663 |
Copyright terms: Public domain | W3C validator |