Theorem opabresid 6010

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 5520	. . . 4 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}
2		equcom 2020	. . . . 5 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥)
3	2	opabbii 5153	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥}
4	1, 3	eqtri 2760	. . 3 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥}
5	4	reseq1i 5935	. 2 ⊢ ( I ↾ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} ↾ 𝐴)
6		resopab 5994	. 2 ⊢ ({⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)}
7	5, 6	eqtri 2760	1 ⊢ ( I ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)}

Syntax hints:   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {copab 5148   I cid 5519   ↾ cres 5627

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-pr 5371

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-opab 5149  df-id 5520  df-xp 5631  df-rel 5632  df-res 5637

This theorem is referenced by:  mptresid  6011  iresn0n0  6014  pospo  18303  eqg0subg  19165  opsrtoslem1  22046  tgphaus  24095  relexp0eq  44149