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

Theorem restidsing 5069
Description: Restriction of the identity to a singleton. (Contributed by FL, 2-Aug-2009.) (Proof shortened by JJ, 25-Aug-2021.) (Proof shortened by Peter Mazsa, 6-Oct-2022.)
Assertion
Ref Expression
restidsing  |-  (  _I  |`  { A } )  =  ( { A }  X.  { A }
)

Proof of Theorem restidsing
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relres 5041 . 2  |-  Rel  (  _I  |`  { A }
)
2 relxp 4835 . 2  |-  Rel  ( { A }  X.  { A } )
3 velsn 3686 . . . . 5  |-  ( x  e.  { A }  <->  x  =  A )
4 velsn 3686 . . . . 5  |-  ( y  e.  { A }  <->  y  =  A )
53, 4anbi12i 460 . . . 4  |-  ( ( x  e.  { A }  /\  y  e.  { A } )  <->  ( x  =  A  /\  y  =  A ) )
6 vex 2805 . . . . . . 7  |-  y  e. 
_V
76ideq 4882 . . . . . 6  |-  ( x  _I  y  <->  x  =  y )
83, 7anbi12i 460 . . . . 5  |-  ( ( x  e.  { A }  /\  x  _I  y
)  <->  ( x  =  A  /\  x  =  y ) )
9 eqeq1 2238 . . . . . . 7  |-  ( x  =  A  ->  (
x  =  y  <->  A  =  y ) )
10 eqcom 2233 . . . . . . 7  |-  ( A  =  y  <->  y  =  A )
119, 10bitrdi 196 . . . . . 6  |-  ( x  =  A  ->  (
x  =  y  <->  y  =  A ) )
1211pm5.32i 454 . . . . 5  |-  ( ( x  =  A  /\  x  =  y )  <->  ( x  =  A  /\  y  =  A )
)
138, 12bitri 184 . . . 4  |-  ( ( x  e.  { A }  /\  x  _I  y
)  <->  ( x  =  A  /\  y  =  A ) )
14 df-br 4089 . . . . 5  |-  ( x  _I  y  <->  <. x ,  y >.  e.  _I  )
1514anbi2i 457 . . . 4  |-  ( ( x  e.  { A }  /\  x  _I  y
)  <->  ( x  e. 
{ A }  /\  <.
x ,  y >.  e.  _I  ) )
165, 13, 153bitr2ri 209 . . 3  |-  ( ( x  e.  { A }  /\  <. x ,  y
>.  e.  _I  )  <->  ( x  e.  { A }  /\  y  e.  { A } ) )
176opelres 5018 . . . 4  |-  ( <.
x ,  y >.  e.  (  _I  |`  { A } )  <->  ( <. x ,  y >.  e.  _I  /\  x  e.  { A } ) )
1817biancomi 270 . . 3  |-  ( <.
x ,  y >.  e.  (  _I  |`  { A } )  <->  ( x  e.  { A }  /\  <.
x ,  y >.  e.  _I  ) )
19 opelxp 4755 . . 3  |-  ( <.
x ,  y >.  e.  ( { A }  X.  { A } )  <-> 
( x  e.  { A }  /\  y  e.  { A } ) )
2016, 18, 193bitr4i 212 . 2  |-  ( <.
x ,  y >.  e.  (  _I  |`  { A } )  <->  <. x ,  y >.  e.  ( { A }  X.  { A } ) )
211, 2, 20eqrelriiv 4820 1  |-  (  _I  |`  { A } )  =  ( { A }  X.  { A }
)
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1397    e. wcel 2202   {csn 3669   <.cop 3672   class class class wbr 4088    _I cid 4385    X. cxp 4723    |` cres 4727
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-res 4737
This theorem is referenced by:  grp1inv  13689
  Copyright terms: Public domain W3C validator