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

Theorem 0ima 5000
Description: Image under the empty relation. (Contributed by FL, 11-Jan-2007.)
Assertion
Ref Expression
0ima  |-  ( (/) " A )  =  (/)

Proof of Theorem 0ima
StepHypRef Expression
1 imassrn 4993 . . 3  |-  ( (/) " A )  C_  ran  (/)
2 rn0 4895 . . 3  |-  ran  (/)  =  (/)
31, 2sseqtri 3201 . 2  |-  ( (/) " A )  C_  (/)
4 0ss 3473 . 2  |-  (/)  C_  ( (/) " A )
53, 4eqssi 3183 1  |-  ( (/) " A )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1363   (/)c0 3434   ran crn 4639   "cima 4641
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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-rex 2471  df-v 2751  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-br 4016  df-opab 4077  df-xp 4644  df-cnv 4646  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator