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

Theorem 0fv 5686
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 5341 . 2  |-  ( (/) `  A )  =  ( iota x A (/) x )
2 noel 3500 . . . . . 6  |-  -.  <. A ,  x >.  e.  (/)
3 df-br 4094 . . . . . 6  |-  ( A
(/) x  <->  <. A ,  x >.  e.  (/) )
42, 3mtbir 678 . . . . 5  |-  -.  A (/) x
54nex 1549 . . . 4  |-  -.  E. x  A (/) x
6 euex 2109 . . . 4  |-  ( E! x  A (/) x  ->  E. x  A (/) x )
75, 6mto 668 . . 3  |-  -.  E! x  A (/) x
8 iotanul 5309 . . 3  |-  ( -.  E! x  A (/) x  ->  ( iota x A (/) x )  =  (/) )
97, 8ax-mp 5 . 2  |-  ( iota
x A (/) x )  =  (/)
101, 9eqtri 2252 1  |-  ( (/) `  A )  =  (/)
Colors of variables: wff set class
Syntax hints:   -. wn 3    = wceq 1398   E.wex 1541   E!weu 2079    e. wcel 2202   (/)c0 3496   <.cop 3676   class class class wbr 4093   iotacio 5291   ` cfv 5333
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-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  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-in 3207  df-ss 3214  df-nul 3497  df-sn 3679  df-uni 3899  df-br 4094  df-iota 5293  df-fv 5341
This theorem is referenced by:  fv2prc  5687  ccat1st1st  11284  strsl0  13211
  Copyright terms: Public domain W3C validator