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

Theorem 0ima 5103
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 5093 . . 3  |-  ( (/) " A )  C_  ran  (/)
2 rn0 4994 . . 3  |-  ran  (/)  =  (/)
31, 2sseqtri 3262 . 2  |-  ( (/) " A )  C_  (/)
4 0ss 3535 . 2  |-  (/)  C_  ( (/) " A )
53, 4eqssi 3244 1  |-  ( (/) " A )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1398   (/)c0 3496   ran crn 4732   "cima 4734
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-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  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-br 4094  df-opab 4156  df-xp 4737  df-cnv 4739  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator