Theorem opabresid 6001

Description: The restricted identity relation expressed as an ordered-pair class abstraction. (Contributed by FL, 25-Apr-2012.)

Assertion

Ref	Expression
opabresid	⊢ ( I ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)}

Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem opabresid

Step	Hyp	Ref	Expression
1		df-id 5514	. . . 4 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}
2		equcom 2018	. . . . 5 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥)
3	2	opabbii 5159	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥}
4	1, 3	eqtri 2752	. . 3 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥}
5	4	reseq1i 5926	. 2 ⊢ ( I ↾ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} ↾ 𝐴)
6		resopab 5985	. 2 ⊢ ({⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)}
7	5, 6	eqtri 2752	1 ⊢ ( I ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)}

Syntax hints:   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {copab 5154   I cid 5513   ↾ cres 5621

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 5235  ax-nul 5245  ax-pr 5371

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 3395  df-v 3438  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-opab 5155  df-id 5514  df-xp 5625  df-rel 5626  df-res 5631

This theorem is referenced by:  mptresid  6002  iresn0n0  6005  pospo  18249  eqg0subg  19075  opsrtoslem1  21960  tgphaus  24002  relexp0eq  43678