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

Theorem fun0 3540
Description: The empty set is a function. Theorem 10.3 of [Quine] p. 65.
Assertion
Ref Expression
fun0 |- Fun (/)

Proof of Theorem fun0
StepHypRef Expression
1 0ss 2298 . 2 |- (/) (_ {<.(/), (/)>.}
2 0ex 2707 . . 3 |- (/) e. V
32, 2funsn 3539 . 2 |- Fun {<.(/), (/)>.}
4 funss 3530 . 2 |- ((/) (_ {<.(/), (/)>.} -> (Fun {<.(/), (/)>.} -> Fun (/)))
51, 3, 4mp2 43 1 |- Fun (/)
Colors of variables: wff set class
Syntax hints:   (_ wss 2044  (/)c0 2277  {csn 2406  <.cop 2408  Fun wfun 3172
This theorem is referenced by:  fn0 3601  f10 3708  0alg 10605
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-sep 2699  ax-nul 2706  ax-pow 2738  ax-pr 2775
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-v 1809  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-nul 2278  df-pw 2399  df-sn 2409  df-pr 2410  df-op 2413  df-br 2616  df-opab 2663  df-id 2831  df-xp 3180  df-rel 3181  df-cnv 3182  df-co 3183  df-fun 3188
Copyright terms: Public domain