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

Theorem 0fv 5464
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 5139 . 2  |-  ( (/) `  A )  =  ( iota x A (/) x )
2 noel 3372 . . . . . 6  |-  -.  <. A ,  x >.  e.  (/)
3 df-br 3938 . . . . . 6  |-  ( A
(/) x  <->  <. A ,  x >.  e.  (/) )
42, 3mtbir 661 . . . . 5  |-  -.  A (/) x
54nex 1477 . . . 4  |-  -.  E. x  A (/) x
6 euex 2030 . . . 4  |-  ( E! x  A (/) x  ->  E. x  A (/) x )
75, 6mto 652 . . 3  |-  -.  E! x  A (/) x
8 iotanul 5111 . . 3  |-  ( -.  E! x  A (/) x  ->  ( iota x A (/) x )  =  (/) )
97, 8ax-mp 5 . 2  |-  ( iota
x A (/) x )  =  (/)
101, 9eqtri 2161 1  |-  ( (/) `  A )  =  (/)
Colors of variables: wff set class
Syntax hints:   -. wn 3    = wceq 1332   E.wex 1469    e. wcel 1481   E!weu 2000   (/)c0 3368   <.cop 3535   class class class wbr 3937   iotacio 5094   ` cfv 5131
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-dif 3078  df-in 3082  df-ss 3089  df-nul 3369  df-sn 3538  df-uni 3745  df-br 3938  df-iota 5096  df-fv 5139
This theorem is referenced by:  strsl0  12046
  Copyright terms: Public domain W3C validator