HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem rn0 4203
Description: The range of the empty set is empty. Part of Theorem 3.8(v) of [Monk1] p. 36.
Assertion
Ref Expression
rn0 |- ran (/) = (/)

Proof of Theorem rn0
StepHypRef Expression
1 dm0 4170 . 2 |- dom (/) = (/)
2 dm0rn0 4175 . 2 |- (dom (/) = (/) <-> ran (/) = (/))
31, 2mpbi 206 1 |- ran (/) = (/)
Colors of variables: wff set class
Syntax hints:   = wceq 1298  (/)c0 2875  dom cdm 3986  ran crn 3987
This theorem is referenced by:  ima0 4283  0ima 4284  rnxpssOLD 4345  f0 4600  2ndval 5023  map0e 5401  fodomr 5547  aceq5lem3 5899  infxpidmlem4 8824  infxpidmlem8 8828  infxpidmlem10 8830  0ngrp 9335  gid0 9338  ga0 9453  bafval 9555  frxp 13951  rnxpid 14409  0alg 15103
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-br 3339  df-opab 3396  df-cnv 4002  df-dm 4004  df-rn 4005
Copyright terms: Public domain