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

Theorem 0fv 5590
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 5262 . 2  |-  ( (/) `  A )  =  ( iota x A (/) x )
2 noel 3450 . . . . . 6  |-  -.  <. A ,  x >.  e.  (/)
3 df-br 4030 . . . . . 6  |-  ( A
(/) x  <->  <. A ,  x >.  e.  (/) )
42, 3mtbir 672 . . . . 5  |-  -.  A (/) x
54nex 1511 . . . 4  |-  -.  E. x  A (/) x
6 euex 2072 . . . 4  |-  ( E! x  A (/) x  ->  E. x  A (/) x )
75, 6mto 663 . . 3  |-  -.  E! x  A (/) x
8 iotanul 5230 . . 3  |-  ( -.  E! x  A (/) x  ->  ( iota x A (/) x )  =  (/) )
97, 8ax-mp 5 . 2  |-  ( iota
x A (/) x )  =  (/)
101, 9eqtri 2214 1  |-  ( (/) `  A )  =  (/)
Colors of variables: wff set class
Syntax hints:   -. wn 3    = wceq 1364   E.wex 1503   E!weu 2042    e. wcel 2164   (/)c0 3446   <.cop 3621   class class class wbr 4029   iotacio 5213   ` cfv 5254
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3155  df-in 3159  df-ss 3166  df-nul 3447  df-sn 3624  df-uni 3836  df-br 4030  df-iota 5215  df-fv 5262
This theorem is referenced by:  fv2prc  5591  strsl0  12667
  Copyright terms: Public domain W3C validator