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

Theorem nfunsn 5455
Description: If the restriction of a class to a singleton is not a function, its value is the empty set. (Contributed by NM, 8-Aug-2010.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Assertion
Ref Expression
nfunsn  |-  ( -. 
Fun  ( F  |`  { A } )  -> 
( F `  A
)  =  (/) )

Proof of Theorem nfunsn
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eumo 2031 . . . . . . 7  |-  ( E! y  A F y  ->  E* y  A F y )
2 vex 2689 . . . . . . . . . 10  |-  y  e. 
_V
32brres 4825 . . . . . . . . 9  |-  ( x ( F  |`  { A } ) y  <->  ( x F y  /\  x  e.  { A } ) )
4 velsn 3544 . . . . . . . . . . 11  |-  ( x  e.  { A }  <->  x  =  A )
5 breq1 3932 . . . . . . . . . . 11  |-  ( x  =  A  ->  (
x F y  <->  A F
y ) )
64, 5sylbi 120 . . . . . . . . . 10  |-  ( x  e.  { A }  ->  ( x F y  <-> 
A F y ) )
76biimpac 296 . . . . . . . . 9  |-  ( ( x F y  /\  x  e.  { A } )  ->  A F y )
83, 7sylbi 120 . . . . . . . 8  |-  ( x ( F  |`  { A } ) y  ->  A F y )
98moimi 2064 . . . . . . 7  |-  ( E* y  A F y  ->  E* y  x ( F  |`  { A } ) y )
101, 9syl 14 . . . . . 6  |-  ( E! y  A F y  ->  E* y  x ( F  |`  { A } ) y )
1110alrimiv 1846 . . . . 5  |-  ( E! y  A F y  ->  A. x E* y  x ( F  |`  { A } ) y )
12 relres 4847 . . . . 5  |-  Rel  ( F  |`  { A }
)
1311, 12jctil 310 . . . 4  |-  ( E! y  A F y  ->  ( Rel  ( F  |`  { A }
)  /\  A. x E* y  x ( F  |`  { A }
) y ) )
14 dffun6 5137 . . . 4  |-  ( Fun  ( F  |`  { A } )  <->  ( Rel  ( F  |`  { A } )  /\  A. x E* y  x ( F  |`  { A } ) y ) )
1513, 14sylibr 133 . . 3  |-  ( E! y  A F y  ->  Fun  ( F  |` 
{ A } ) )
1615con3i 621 . 2  |-  ( -. 
Fun  ( F  |`  { A } )  ->  -.  E! y  A F y )
17 tz6.12-2 5412 . 2  |-  ( -.  E! y  A F y  ->  ( F `  A )  =  (/) )
1816, 17syl 14 1  |-  ( -. 
Fun  ( F  |`  { A } )  -> 
( F `  A
)  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104   A.wal 1329    = wceq 1331    e. wcel 1480   E!weu 1999   E*wmo 2000   (/)c0 3363   {csn 3527   class class class wbr 3929    |` cres 4541   Rel wrel 4544   Fun wfun 5117   ` cfv 5123
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-res 4551  df-iota 5088  df-fun 5125  df-fv 5131
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator