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

Theorem relssres 4985
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 109 . . . 4  |-  ( ( Rel  A  /\  dom  A 
C_  B )  ->  Rel  A )
2 vex 2766 . . . . . . . . 9  |-  x  e. 
_V
3 vex 2766 . . . . . . . . 9  |-  y  e. 
_V
42, 3opeldm 4870 . . . . . . . 8  |-  ( <.
x ,  y >.  e.  A  ->  x  e. 
dom  A )
5 ssel 3178 . . . . . . . 8  |-  ( dom 
A  C_  B  ->  ( x  e.  dom  A  ->  x  e.  B ) )
64, 5syl5 32 . . . . . . 7  |-  ( dom 
A  C_  B  ->  (
<. x ,  y >.  e.  A  ->  x  e.  B ) )
76ancld 325 . . . . . 6  |-  ( dom 
A  C_  B  ->  (
<. x ,  y >.  e.  A  ->  ( <.
x ,  y >.  e.  A  /\  x  e.  B ) ) )
83opelres 4952 . . . . . 6  |-  ( <.
x ,  y >.  e.  ( A  |`  B )  <-> 
( <. x ,  y
>.  e.  A  /\  x  e.  B ) )
97, 8imbitrrdi 162 . . . . 5  |-  ( dom 
A  C_  B  ->  (
<. x ,  y >.  e.  A  ->  <. x ,  y >.  e.  ( A  |`  B )
) )
109adantl 277 . . . 4  |-  ( ( Rel  A  /\  dom  A 
C_  B )  -> 
( <. x ,  y
>.  e.  A  ->  <. x ,  y >.  e.  ( A  |`  B )
) )
111, 10relssdv 4756 . . 3  |-  ( ( Rel  A  /\  dom  A 
C_  B )  ->  A  C_  ( A  |`  B ) )
12 resss 4971 . . 3  |-  ( A  |`  B )  C_  A
1311, 12jctil 312 . 2  |-  ( ( Rel  A  /\  dom  A 
C_  B )  -> 
( ( A  |`  B )  C_  A  /\  A  C_  ( A  |`  B ) ) )
14 eqss 3199 . 2  |-  ( ( A  |`  B )  =  A  <->  ( ( A  |`  B )  C_  A  /\  A  C_  ( A  |`  B ) ) )
1513, 14sylibr 134 1  |-  ( ( Rel  A  /\  dom  A 
C_  B )  -> 
( A  |`  B )  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2167    C_ wss 3157   <.cop 3626   dom cdm 4664    |` cres 4666   Rel wrel 4669
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-br 4035  df-opab 4096  df-xp 4670  df-rel 4671  df-dm 4674  df-res 4676
This theorem is referenced by:  resdm  4986  resid  5004  fnresdm  5370  f1ompt  5716  setscom  12743  setsslid  12754
  Copyright terms: Public domain W3C validator