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

Theorem reldmress 12056
Description: The structure restriction is a proper operator, so it can be used with ovprc1 5815. (Contributed by Stefan O'Rear, 29-Nov-2014.)
Assertion
Ref Expression
reldmress  |-  Rel  doms

Proof of Theorem reldmress
Dummy variables  w  a are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ress 12006 . 2  |-s  =  ( w  e.  _V ,  a  e. 
_V  |->  if ( (
Base `  w )  C_  a ,  w ,  ( w sSet  <. ( Base `  ndx ) ,  ( a  i^i  ( Base `  w ) )
>. ) ) )
21reldmmpo 5890 1  |-  Rel  doms
Colors of variables: wff set class
Syntax hints:   _Vcvv 2689    i^i cin 3075    C_ wss 3076   ifcif 3479   <.cop 3535   dom cdm 4547   Rel wrel 4552   ` cfv 5131  (class class class)co 5782   ndxcnx 11995   sSet csts 11996   Basecbs 11998   ↾s cress 11999
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-br 3938  df-opab 3998  df-xp 4553  df-rel 4554  df-dm 4557  df-oprab 5786  df-mpo 5787  df-ress 12006
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator