let f1, f2 be Function of X,([#] R); ( ( for x being object st x in X holds
( ( x = a implies f1 . x = 1. R ) & ( x <> a implies f1 . x = 0. R ) ) ) & ( for x being object st x in X holds
( ( x = a implies f2 . x = 1. R ) & ( x <> a implies f2 . x = 0. R ) ) ) implies f1 = f2 )
assume that
A5:
for x being object st x in X holds
( ( x = a implies f1 . x = 1. R ) & ( x <> a implies f1 . x = 0. R ) )
and
A6:
for x being object st x in X holds
( ( x = a implies f2 . x = 1. R ) & ( x <> a implies f2 . x = 0. R ) )
; f1 = f2
for x being object st x in X holds
f1 . x = f2 . x
proof
let x be
object ;
( x in X implies f1 . x = f2 . x )
assume
x in X
;
f1 . x = f2 . x
then A7:
(
x <> a implies (
f1 . x = 0. R &
f2 . x = 0. R ) )
by A5, A6;
(
x = a implies (
f1 . x = 1. R &
f2 . x = 1. R ) )
by A5, A6;
hence
f1 . x = f2 . x
by A7;
verum
end;
hence
f1 = f2
; verum