ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  opabresid Unicode version

Theorem opabresid 4659
Description: The restricted identity expressed with the class builder. (Contributed by FL, 25-Apr-2012.)
Assertion
Ref Expression
opabresid  |-  { <. x ,  y >.  |  ( x  e.  A  /\  y  =  x ) }  =  (  _I  |`  A )
Distinct variable group:    x, A, y

Proof of Theorem opabresid
StepHypRef Expression
1 resopab 4652 . 2  |-  ( {
<. x ,  y >.  |  y  =  x }  |`  A )  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  x ) }
2 equcom 1593 . . . . 5  |-  ( y  =  x  <->  x  =  y )
32opabbii 3824 . . . 4  |-  { <. x ,  y >.  |  y  =  x }  =  { <. x ,  y
>.  |  x  =  y }
4 df-id 4030 . . . 4  |-  _I  =  { <. x ,  y
>.  |  x  =  y }
53, 4eqtr4i 2063 . . 3  |-  { <. x ,  y >.  |  y  =  x }  =  _I
65reseq1i 4608 . 2  |-  ( {
<. x ,  y >.  |  y  =  x }  |`  A )  =  (  _I  |`  A )
71, 6eqtr3i 2062 1  |-  { <. x ,  y >.  |  ( x  e.  A  /\  y  =  x ) }  =  (  _I  |`  A )
Colors of variables: wff set class
Syntax hints:    /\ wa 97    = wceq 1243    e. wcel 1393   {copab 3817    _I cid 4025    |` cres 4347
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-opab 3819  df-id 4030  df-xp 4351  df-rel 4352  df-res 4357
This theorem is referenced by:  mptresid  4660
  Copyright terms: Public domain W3C validator