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

Theorem res0 5044
Description: A restriction to the empty set is empty. (Contributed by NM, 12-Nov-1994.)
Assertion
Ref Expression
res0  |-  ( A  |`  (/) )  =  (/)

Proof of Theorem res0
StepHypRef Expression
1 df-res 4763 . 2  |-  ( A  |`  (/) )  =  ( A  i^i  ( (/)  X. 
_V ) )
2 0xp 4832 . . 3  |-  ( (/)  X. 
_V )  =  (/)
32ineq2i 3421 . 2  |-  ( A  i^i  ( (/)  X.  _V ) )  =  ( A  i^i  (/) )
4 in0 3545 . 2  |-  ( A  i^i  (/) )  =  (/)
51, 3, 43eqtri 2259 1  |-  ( A  |`  (/) )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1398   _Vcvv 2815    i^i cin 3212   (/)c0 3510    X. cxp 4749    |` cres 4753
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-in1 619  ax-in2 620  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-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-opab 4174  df-xp 4757  df-res 4763
This theorem is referenced by:  ima0  5123  resdisj  5193  smo0  6531  tfr0dm  6555  tfr0  6556  fnfi  7205  setsslid  13280  gsumsplit0  14080  egrsubgr  16275  0grsubgr  16276  eupth2lembfi  16489  gfsumcl  16887
  Copyright terms: Public domain W3C validator