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

Theorem iss 4946
Description: A subclass of the identity function is the identity function restricted to its domain. (Contributed by NM, 13-Dec-2003.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
iss  |-  ( A 
C_  _I  <->  A  =  (  _I  |`  dom  A ) )

Proof of Theorem iss
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssel 3147 . . . . . . 7  |-  ( A 
C_  _I  ->  ( <.
x ,  y >.  e.  A  ->  <. x ,  y >.  e.  _I  ) )
2 vex 2738 . . . . . . . . 9  |-  x  e. 
_V
3 vex 2738 . . . . . . . . 9  |-  y  e. 
_V
42, 3opeldm 4823 . . . . . . . 8  |-  ( <.
x ,  y >.  e.  A  ->  x  e. 
dom  A )
54a1i 9 . . . . . . 7  |-  ( A 
C_  _I  ->  ( <.
x ,  y >.  e.  A  ->  x  e. 
dom  A ) )
61, 5jcad 307 . . . . . 6  |-  ( A 
C_  _I  ->  ( <.
x ,  y >.  e.  A  ->  ( <.
x ,  y >.  e.  _I  /\  x  e. 
dom  A ) ) )
7 df-br 3999 . . . . . . . . 9  |-  ( x  _I  y  <->  <. x ,  y >.  e.  _I  )
83ideq 4772 . . . . . . . . 9  |-  ( x  _I  y  <->  x  =  y )
97, 8bitr3i 186 . . . . . . . 8  |-  ( <.
x ,  y >.  e.  _I  <->  x  =  y
)
102eldm2 4818 . . . . . . . . . 10  |-  ( x  e.  dom  A  <->  E. y <. x ,  y >.  e.  A )
11 opeq2 3775 . . . . . . . . . . . . . . 15  |-  ( x  =  y  ->  <. x ,  x >.  =  <. x ,  y >. )
1211eleq1d 2244 . . . . . . . . . . . . . 14  |-  ( x  =  y  ->  ( <. x ,  x >.  e.  A  <->  <. x ,  y
>.  e.  A ) )
1312biimprcd 160 . . . . . . . . . . . . 13  |-  ( <.
x ,  y >.  e.  A  ->  ( x  =  y  ->  <. x ,  x >.  e.  A
) )
149, 13biimtrid 152 . . . . . . . . . . . 12  |-  ( <.
x ,  y >.  e.  A  ->  ( <.
x ,  y >.  e.  _I  ->  <. x ,  x >.  e.  A
) )
151, 14sylcom 28 . . . . . . . . . . 11  |-  ( A 
C_  _I  ->  ( <.
x ,  y >.  e.  A  ->  <. x ,  x >.  e.  A
) )
1615exlimdv 1817 . . . . . . . . . 10  |-  ( A 
C_  _I  ->  ( E. y <. x ,  y
>.  e.  A  ->  <. x ,  x >.  e.  A
) )
1710, 16biimtrid 152 . . . . . . . . 9  |-  ( A 
C_  _I  ->  ( x  e.  dom  A  ->  <. x ,  x >.  e.  A ) )
1812imbi2d 230 . . . . . . . . 9  |-  ( x  =  y  ->  (
( x  e.  dom  A  ->  <. x ,  x >.  e.  A )  <->  ( x  e.  dom  A  ->  <. x ,  y >.  e.  A
) ) )
1917, 18syl5ibcom 155 . . . . . . . 8  |-  ( A 
C_  _I  ->  ( x  =  y  ->  (
x  e.  dom  A  -> 
<. x ,  y >.  e.  A ) ) )
209, 19biimtrid 152 . . . . . . 7  |-  ( A 
C_  _I  ->  ( <.
x ,  y >.  e.  _I  ->  ( x  e.  dom  A  ->  <. x ,  y >.  e.  A
) ) )
2120impd 254 . . . . . 6  |-  ( A 
C_  _I  ->  ( (
<. x ,  y >.  e.  _I  /\  x  e. 
dom  A )  ->  <. x ,  y >.  e.  A ) )
226, 21impbid 129 . . . . 5  |-  ( A 
C_  _I  ->  ( <.
x ,  y >.  e.  A  <->  ( <. x ,  y >.  e.  _I  /\  x  e.  dom  A ) ) )
233opelres 4905 . . . . 5  |-  ( <.
x ,  y >.  e.  (  _I  |`  dom  A
)  <->  ( <. x ,  y >.  e.  _I  /\  x  e.  dom  A ) )
2422, 23bitr4di 198 . . . 4  |-  ( A 
C_  _I  ->  ( <.
x ,  y >.  e.  A  <->  <. x ,  y
>.  e.  (  _I  |`  dom  A
) ) )
2524alrimivv 1873 . . 3  |-  ( A 
C_  _I  ->  A. x A. y ( <. x ,  y >.  e.  A  <->  <.
x ,  y >.  e.  (  _I  |`  dom  A
) ) )
26 reli 4749 . . . . 5  |-  Rel  _I
27 relss 4707 . . . . 5  |-  ( A 
C_  _I  ->  ( Rel 
_I  ->  Rel  A )
)
2826, 27mpi 15 . . . 4  |-  ( A 
C_  _I  ->  Rel  A
)
29 relres 4928 . . . 4  |-  Rel  (  _I  |`  dom  A )
30 eqrel 4709 . . . 4  |-  ( ( Rel  A  /\  Rel  (  _I  |`  dom  A
) )  ->  ( A  =  (  _I  |` 
dom  A )  <->  A. x A. y ( <. x ,  y >.  e.  A  <->  <.
x ,  y >.  e.  (  _I  |`  dom  A
) ) ) )
3128, 29, 30sylancl 413 . . 3  |-  ( A 
C_  _I  ->  ( A  =  (  _I  |`  dom  A
)  <->  A. x A. y
( <. x ,  y
>.  e.  A  <->  <. x ,  y >.  e.  (  _I  |`  dom  A ) ) ) )
3225, 31mpbird 167 . 2  |-  ( A 
C_  _I  ->  A  =  (  _I  |`  dom  A
) )
33 resss 4924 . . 3  |-  (  _I  |`  dom  A )  C_  _I
34 sseq1 3176 . . 3  |-  ( A  =  (  _I  |`  dom  A
)  ->  ( A  C_  _I  <->  (  _I  |`  dom  A
)  C_  _I  )
)
3533, 34mpbiri 168 . 2  |-  ( A  =  (  _I  |`  dom  A
)  ->  A  C_  _I  )
3632, 35impbii 126 1  |-  ( A 
C_  _I  <->  A  =  (  _I  |`  dom  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1351    = wceq 1353   E.wex 1490    e. wcel 2146    C_ wss 3127   <.cop 3592   class class class wbr 3998    _I cid 4282   dom cdm 4620    |` cres 4622   Rel wrel 4625
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 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-v 2737  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-br 3999  df-opab 4060  df-id 4287  df-xp 4626  df-rel 4627  df-dm 4630  df-res 4632
This theorem is referenced by:  funcocnv2  5478
  Copyright terms: Public domain W3C validator