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

Theorem 0ima 5061
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 5052 . . 3  |-  ( (/) " A )  C_  ran  (/)
2 rn0 4953 . . 3  |-  ran  (/)  =  (/)
31, 2sseqtri 3235 . 2  |-  ( (/) " A )  C_  (/)
4 0ss 3507 . 2  |-  (/)  C_  ( (/) " A )
53, 4eqssi 3217 1  |-  ( (/) " A )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1373   (/)c0 3468   ran crn 4694   "cima 4696
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-br 4060  df-opab 4122  df-xp 4699  df-cnv 4701  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator