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

Theorem resiexg 5088
Description: The existence of a restricted identity function, proved without using the Axiom of Replacement. (Contributed by NM, 13-Jan-2007.)
Assertion
Ref Expression
resiexg  |-  ( A  e.  V  ->  (  _I  |`  A )  e. 
_V )

Proof of Theorem resiexg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relres 5071 . . 3  |-  Rel  (  _I  |`  A )
2 simpr 110 . . . . 5  |-  ( ( x  =  y  /\  x  e.  A )  ->  x  e.  A )
3 eleq1 2297 . . . . . 6  |-  ( x  =  y  ->  (
x  e.  A  <->  y  e.  A ) )
43biimpa 296 . . . . 5  |-  ( ( x  =  y  /\  x  e.  A )  ->  y  e.  A )
52, 4jca 306 . . . 4  |-  ( ( x  =  y  /\  x  e.  A )  ->  ( x  e.  A  /\  y  e.  A
) )
6 vex 2818 . . . . . 6  |-  y  e. 
_V
76opelres 5048 . . . . 5  |-  ( <.
x ,  y >.  e.  (  _I  |`  A )  <-> 
( <. x ,  y
>.  e.  _I  /\  x  e.  A ) )
8 df-br 4115 . . . . . . 7  |-  ( x  _I  y  <->  <. x ,  y >.  e.  _I  )
96ideq 4912 . . . . . . 7  |-  ( x  _I  y  <->  x  =  y )
108, 9bitr3i 186 . . . . . 6  |-  ( <.
x ,  y >.  e.  _I  <->  x  =  y
)
1110anbi1i 458 . . . . 5  |-  ( (
<. x ,  y >.  e.  _I  /\  x  e.  A )  <->  ( x  =  y  /\  x  e.  A ) )
127, 11bitri 184 . . . 4  |-  ( <.
x ,  y >.  e.  (  _I  |`  A )  <-> 
( x  =  y  /\  x  e.  A
) )
13 opelxp 4784 . . . 4  |-  ( <.
x ,  y >.  e.  ( A  X.  A
)  <->  ( x  e.  A  /\  y  e.  A ) )
145, 12, 133imtr4i 201 . . 3  |-  ( <.
x ,  y >.  e.  (  _I  |`  A )  ->  <. x ,  y
>.  e.  ( A  X.  A ) )
151, 14relssi 4846 . 2  |-  (  _I  |`  A )  C_  ( A  X.  A )
16 xpexg 4869 . . 3  |-  ( ( A  e.  V  /\  A  e.  V )  ->  ( A  X.  A
)  e.  _V )
1716anidms 397 . 2  |-  ( A  e.  V  ->  ( A  X.  A )  e. 
_V )
18 ssexg 4254 . 2  |-  ( ( (  _I  |`  A ) 
C_  ( A  X.  A )  /\  ( A  X.  A )  e. 
_V )  ->  (  _I  |`  A )  e. 
_V )
1915, 17, 18sylancr 414 1  |-  ( A  e.  V  ->  (  _I  |`  A )  e. 
_V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2205   _Vcvv 2815    C_ wss 3214   <.cop 3697   class class class wbr 4114    _I cid 4414    X. cxp 4752    |` cres 4756
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-res 4766
This theorem is referenced by:  ordiso  7340  omct  7421  ctssexmid  7454  ssomct  13280  ndxarg  13319  ausgrusgrben  16289  subctctexmid  16900
  Copyright terms: Public domain W3C validator