![]() |
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 5575 | . . . 4 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} | |
2 | equcom 2020 | . . . . 5 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥) | |
3 | 2 | opabbii 5216 | . . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} |
4 | 1, 3 | eqtri 2759 | . . 3 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} |
5 | 4 | reseq1i 5978 | . 2 ⊢ ( I ↾ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} ↾ 𝐴) |
6 | resopab 6035 | . 2 ⊢ ({⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} | |
7 | 5, 6 | eqtri 2759 | 1 ⊢ ( I ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 395 = wceq 1540 ∈ wcel 2105 {copab 5211 I cid 5574 ↾ cres 5679 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-12 2170 ax-ext 2702 ax-sep 5300 ax-nul 5307 ax-pr 5428 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-rab 3432 df-v 3475 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-opab 5212 df-id 5575 df-xp 5683 df-rel 5684 df-res 5689 |
This theorem is referenced by: mptresid 6051 iresn0n0 6054 pospo 18303 eqg0subg 19112 opsrtoslem1 21836 tgphaus 23842 relexp0eq 42755 |
Copyright terms: Public domain | W3C validator |