let C be non empty set ; :: thesis: for f being PartFunc of C,COMPLEX holds
( |.f.| " {0 } = f " {0 } & (- f) " {0 } = f " {0 } )

let f be PartFunc of C,COMPLEX ; :: thesis: ( |.f.| " {0 } = f " {0 } & (- f) " {0 } = f " {0 } )
A1: dom |.f.| = dom f by VALUED_1:def 11;
now end;
hence |.f.| " {0 } = f " {0 } by SUBSET_1:8; :: thesis: (- f) " {0 } = f " {0 }
now
let c be Element of C; :: thesis: ( ( c in (- f) " {0c } implies c in f " {0c } ) & ( c in f " {0c } implies c in (- f) " {0c } ) )
thus ( c in (- f) " {0c } implies c in f " {0c } ) :: thesis: ( c in f " {0c } implies c in (- f) " {0c } )
proof end;
assume A12: c in f " {0c } ; :: thesis: c in (- f) " {0c }
then f /. c in {0c } by PARTFUN2:44;
then A13: f /. c = 0c by TARSKI:def 1;
A14: c in dom f by A12, PARTFUN2:44;
then c in dom (- f) by Th9;
then (- f) /. c = - 0c by A13, Th9;
then A15: (- f) /. c in {0c } by TARSKI:def 1;
c in dom (- f) by A14, Th9;
hence c in (- f) " {0c } by A15, PARTFUN2:44; :: thesis: verum
end;
hence (- f) " {0 } = f " {0 } by SUBSET_1:8; :: thesis: verum