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

Theorem resieq 4919
Description: A restricted identity relation is equivalent to equality in its domain. (Contributed by NM, 30-Apr-2004.)
Assertion
Ref Expression
resieq  |-  ( ( B  e.  A  /\  C  e.  A )  ->  ( B (  _I  |`  A ) C  <->  B  =  C ) )

Proof of Theorem resieq
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 breq2 4009 . . . . 5  |-  ( x  =  C  ->  ( B (  _I  |`  A ) x  <->  B (  _I  |`  A ) C ) )
2 eqeq2 2187 . . . . 5  |-  ( x  =  C  ->  ( B  =  x  <->  B  =  C ) )
31, 2bibi12d 235 . . . 4  |-  ( x  =  C  ->  (
( B (  _I  |`  A ) x  <->  B  =  x )  <->  ( B
(  _I  |`  A ) C  <->  B  =  C
) ) )
43imbi2d 230 . . 3  |-  ( x  =  C  ->  (
( B  e.  A  ->  ( B (  _I  |`  A ) x  <->  B  =  x ) )  <->  ( B  e.  A  ->  ( B (  _I  |`  A ) C  <->  B  =  C
) ) ) )
5 vex 2742 . . . . 5  |-  x  e. 
_V
65opres 4918 . . . 4  |-  ( B  e.  A  ->  ( <. B ,  x >.  e.  (  _I  |`  A )  <->  <. B ,  x >.  e.  _I  ) )
7 df-br 4006 . . . 4  |-  ( B (  _I  |`  A ) x  <->  <. B ,  x >.  e.  (  _I  |`  A ) )
85ideq 4781 . . . . 5  |-  ( B  _I  x  <->  B  =  x )
9 df-br 4006 . . . . 5  |-  ( B  _I  x  <->  <. B ,  x >.  e.  _I  )
108, 9bitr3i 186 . . . 4  |-  ( B  =  x  <->  <. B ,  x >.  e.  _I  )
116, 7, 103bitr4g 223 . . 3  |-  ( B  e.  A  ->  ( B (  _I  |`  A ) x  <->  B  =  x
) )
124, 11vtoclg 2799 . 2  |-  ( C  e.  A  ->  ( B  e.  A  ->  ( B (  _I  |`  A ) C  <->  B  =  C
) ) )
1312impcom 125 1  |-  ( ( B  e.  A  /\  C  e.  A )  ->  ( B (  _I  |`  A ) C  <->  B  =  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353    e. wcel 2148   <.cop 3597   class class class wbr 4005    _I cid 4290    |` cres 4630
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-opab 4067  df-id 4295  df-xp 4634  df-rel 4635  df-res 4640
This theorem is referenced by:  foeqcnvco  5793  f1eqcocnv  5794
  Copyright terms: Public domain W3C validator