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

Theorem 0fv 5229
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 4930 . 2  |-  ( (/) `  A )  =  ( iota x A (/) x )
2 noel 3255 . . . . . 6  |-  -.  <. A ,  x >.  e.  (/)
3 df-br 3786 . . . . . 6  |-  ( A
(/) x  <->  <. A ,  x >.  e.  (/) )
42, 3mtbir 628 . . . . 5  |-  -.  A (/) x
54nex 1429 . . . 4  |-  -.  E. x  A (/) x
6 euex 1971 . . . 4  |-  ( E! x  A (/) x  ->  E. x  A (/) x )
75, 6mto 620 . . 3  |-  -.  E! x  A (/) x
8 iotanul 4902 . . 3  |-  ( -.  E! x  A (/) x  ->  ( iota x A (/) x )  =  (/) )
97, 8ax-mp 7 . 2  |-  ( iota
x A (/) x )  =  (/)
101, 9eqtri 2101 1  |-  ( (/) `  A )  =  (/)
Colors of variables: wff set class
Syntax hints:   -. wn 3    = wceq 1284   E.wex 1421    e. wcel 1433   E!weu 1941   (/)c0 3251   <.cop 3401   class class class wbr 3785   iotacio 4885   ` cfv 4922
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 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-dif 2975  df-in 2979  df-ss 2986  df-nul 3252  df-sn 3404  df-uni 3602  df-br 3786  df-iota 4887  df-fv 4930
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator