let A be non empty set ; :: thesis: for x1, x2, x3 being Element of A st A = {x1,x2,x3} & x1 <> x2 & x1 <> x3 & x2 <> x3 holds
ex f, g, h being Element of Funcs (A,REAL) st
for h9 being Element of Funcs (A,REAL) ex a, b, c being Real st h9 = () . ((() . ((() . [a,f]),(() . [b,g]))),(() . [c,h]))

let x1, x2, x3 be Element of A; :: thesis: ( A = {x1,x2,x3} & x1 <> x2 & x1 <> x3 & x2 <> x3 implies ex f, g, h being Element of Funcs (A,REAL) st
for h9 being Element of Funcs (A,REAL) ex a, b, c being Real st h9 = () . ((() . ((() . [a,f]),(() . [b,g]))),(() . [c,h])) )

assume A1: ( A = {x1,x2,x3} & x1 <> x2 & x1 <> x3 & x2 <> x3 ) ; :: thesis: ex f, g, h being Element of Funcs (A,REAL) st
for h9 being Element of Funcs (A,REAL) ex a, b, c being Real st h9 = () . ((() . ((() . [a,f]),(() . [b,g]))),(() . [c,h]))

consider f being Element of Funcs (A,REAL) such that
A2: ( f . x1 = 1 & ( for z being set st z in A & z <> x1 holds
f . z = 0 ) ) by Th10;
consider h being Element of Funcs (A,REAL) such that
A3: ( h . x3 = 1 & ( for z being set st z in A & z <> x3 holds
h . z = 0 ) ) by Th10;
consider g being Element of Funcs (A,REAL) such that
A4: ( g . x2 = 1 & ( for z being set st z in A & z <> x2 holds
g . z = 0 ) ) by Th10;
take f ; :: thesis: ex g, h being Element of Funcs (A,REAL) st
for h9 being Element of Funcs (A,REAL) ex a, b, c being Real st h9 = () . ((() . ((() . [a,f]),(() . [b,g]))),(() . [c,h]))

take g ; :: thesis: ex h being Element of Funcs (A,REAL) st
for h9 being Element of Funcs (A,REAL) ex a, b, c being Real st h9 = () . ((() . ((() . [a,f]),(() . [b,g]))),(() . [c,h]))

take h ; :: thesis: for h9 being Element of Funcs (A,REAL) ex a, b, c being Real st h9 = () . ((() . ((() . [a,f]),(() . [b,g]))),(() . [c,h]))
let h9 be Element of Funcs (A,REAL); :: thesis: ex a, b, c being Real st h9 = () . ((() . ((() . [a,f]),(() . [b,g]))),(() . [c,h]))
thus ex a, b, c being Real st h9 = () . ((() . ((() . [a,f]),(() . [b,g]))),(() . [c,h])) by A1, A2, A4, A3, Th13; :: thesis: verum