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

Theorem res0 5023
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 4743 . 2  |-  ( A  |`  (/) )  =  ( A  i^i  ( (/)  X. 
_V ) )
2 0xp 4812 . . 3  |-  ( (/)  X. 
_V )  =  (/)
32ineq2i 3407 . 2  |-  ( A  i^i  ( (/)  X.  _V ) )  =  ( A  i^i  (/) )
4 in0 3531 . 2  |-  ( A  i^i  (/) )  =  (/)
51, 3, 43eqtri 2256 1  |-  ( A  |`  (/) )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1398   _Vcvv 2803    i^i cin 3200   (/)c0 3496    X. cxp 4729    |` cres 4733
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 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-opab 4156  df-xp 4737  df-res 4743
This theorem is referenced by:  ima0  5102  resdisj  5172  smo0  6507  tfr0dm  6531  tfr0  6532  fnfi  7178  setsslid  13213  gsumsplit0  14013  egrsubgr  16204  0grsubgr  16205  eupth2lembfi  16418  gfsumcl  16816
  Copyright terms: Public domain W3C validator