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

Theorem 0ima 5025
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 5016 . . 3  |-  ( (/) " A )  C_  ran  (/)
2 rn0 4918 . . 3  |-  ran  (/)  =  (/)
31, 2sseqtri 3213 . 2  |-  ( (/) " A )  C_  (/)
4 0ss 3485 . 2  |-  (/)  C_  ( (/) " A )
53, 4eqssi 3195 1  |-  ( (/) " A )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1364   (/)c0 3446   ran crn 4660   "cima 4662
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-br 4030  df-opab 4091  df-xp 4665  df-cnv 4667  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator