Theorem opabresid 6002

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 5513	. . . 4 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}
2		equcom 2025	. . . . 5 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥)
3	2	opabbii 5139	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥}
4	1, 3	eqtri 2762	. . 3 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥}
5	4	reseq1i 5927	. 2 ⊢ ( I ↾ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} ↾ 𝐴)
6		resopab 5986	. 2 ⊢ ({⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝑥} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)}
7	5, 6	eqtri 2762	1 ⊢ ( I ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)}

Syntax hints:   ∧ wa 396   = wceq 1547   ∈ wcel 2119  {copab 5134   I cid 5512   ↾ cres 5620

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-pr 5362

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-opab 5135  df-id 5513  df-xp 5624  df-rel 5625  df-res 5630

This theorem is referenced by:  mptresid  6003  iresn0n0  6006  pospo  18300  eqg0subg  19162  opsrtoslem1  22031  tgphaus  24100  relexp0eq  44145