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

Theorem 0fv 5323
Description: Function value of the empty set. (Contributed by Stefan O'Rear, 26-Nov-2014.)
Assertion
Ref Expression
0fv  |-  ( (/) `  A )  =  (/)

Proof of Theorem 0fv
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 df-fv 5010 . 2  |-  ( (/) `  A )  =  ( iota x A (/) x )
2 noel 3288 . . . . . 6  |-  -.  <. A ,  x >.  e.  (/)
3 df-br 3838 . . . . . 6  |-  ( A
(/) x  <->  <. A ,  x >.  e.  (/) )
42, 3mtbir 631 . . . . 5  |-  -.  A (/) x
54nex 1434 . . . 4  |-  -.  E. x  A (/) x
6 euex 1978 . . . 4  |-  ( E! x  A (/) x  ->  E. x  A (/) x )
75, 6mto 623 . . 3  |-  -.  E! x  A (/) x
8 iotanul 4982 . . 3  |-  ( -.  E! x  A (/) x  ->  ( iota x A (/) x )  =  (/) )
97, 8ax-mp 7 . 2  |-  ( iota
x A (/) x )  =  (/)
101, 9eqtri 2108 1  |-  ( (/) `  A )  =  (/)
Colors of variables: wff set class
Syntax hints:   -. wn 3    = wceq 1289   E.wex 1426    e. wcel 1438   E!weu 1948   (/)c0 3284   <.cop 3444   class class class wbr 3837   iotacio 4965   ` cfv 5002
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ral 2364  df-rex 2365  df-v 2621  df-dif 2999  df-in 3003  df-ss 3010  df-nul 3285  df-sn 3447  df-uni 3649  df-br 3838  df-iota 4967  df-fv 5010
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator