MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relssres Unicode version

Theorem relssres 4992
Description: Simplification law for restriction. (Contributed by NM, 16-Aug-1994.)
Assertion
Ref Expression
relssres  |-  ( ( Rel  A  /\  dom  A 
C_  B )  -> 
( A  |`  B )  =  A )

Proof of Theorem relssres
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 443 . . . 4  |-  ( ( Rel  A  /\  dom  A 
C_  B )  ->  Rel  A )
2 vex 2791 . . . . . . . . 9  |-  x  e. 
_V
3 vex 2791 . . . . . . . . 9  |-  y  e. 
_V
42, 3opeldm 4882 . . . . . . . 8  |-  ( <.
x ,  y >.  e.  A  ->  x  e. 
dom  A )
5 ssel 3174 . . . . . . . 8  |-  ( dom 
A  C_  B  ->  ( x  e.  dom  A  ->  x  e.  B ) )
64, 5syl5 28 . . . . . . 7  |-  ( dom 
A  C_  B  ->  (
<. x ,  y >.  e.  A  ->  x  e.  B ) )
76ancld 536 . . . . . 6  |-  ( dom 
A  C_  B  ->  (
<. x ,  y >.  e.  A  ->  ( <.
x ,  y >.  e.  A  /\  x  e.  B ) ) )
83opelres 4960 . . . . . 6  |-  ( <.
x ,  y >.  e.  ( A  |`  B )  <-> 
( <. x ,  y
>.  e.  A  /\  x  e.  B ) )
97, 8syl6ibr 218 . . . . 5  |-  ( dom 
A  C_  B  ->  (
<. x ,  y >.  e.  A  ->  <. x ,  y >.  e.  ( A  |`  B )
) )
109adantl 452 . . . 4  |-  ( ( Rel  A  /\  dom  A 
C_  B )  -> 
( <. x ,  y
>.  e.  A  ->  <. x ,  y >.  e.  ( A  |`  B )
) )
111, 10relssdv 4779 . . 3  |-  ( ( Rel  A  /\  dom  A 
C_  B )  ->  A  C_  ( A  |`  B ) )
12 resss 4979 . . 3  |-  ( A  |`  B )  C_  A
1311, 12jctil 523 . 2  |-  ( ( Rel  A  /\  dom  A 
C_  B )  -> 
( ( A  |`  B )  C_  A  /\  A  C_  ( A  |`  B ) ) )
14 eqss 3194 . 2  |-  ( ( A  |`  B )  =  A  <->  ( ( A  |`  B )  C_  A  /\  A  C_  ( A  |`  B ) ) )
1513, 14sylibr 203 1  |-  ( ( Rel  A  /\  dom  A 
C_  B )  -> 
( A  |`  B )  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1623    e. wcel 1684    C_ wss 3152   <.cop 3643   dom cdm 4689    |` cres 4691   Rel wrel 4694
This theorem is referenced by:  resdm  4993  resid  5006  fnresdm  5353  f1ompt  5682  tfr2b  6412  tz7.48-2  6454  omxpenlem  6963  rankwflemb  7465  zorn2lem4  8126  setscom  13176  setsid  13187  dprd2da  15277  dprd2db  15278  dvres3  19263  dvres3a  19264  rlimcnp2  20261  ex-res  20828  indf1ofs  23609  relexpadd  24035  nofulllem3  24358  nofulllem5  24360  resid2  25097
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-br 4024  df-opab 4078  df-xp 4695  df-rel 4696  df-dm 4699  df-res 4701
  Copyright terms: Public domain W3C validator