let f, g be ManySortedSet of A; :: thesis: ( ( for a being object st a in A holds
f . a = <*a*> ) & ( for a being object st a in A holds
g . a = <*a*> ) implies f = g )

assume that
A1: for a being object st a in A holds
f . a = <*a*> and
A2: for a being object st a in A holds
g . a = <*a*> ; :: thesis: f = g
( dom f = A & dom g = A ) by PARTFUN1:def 2;
hence dom f = dom g ; :: according to FUNCT_1:def 11 :: thesis: for b1 being object holds
( not b1 in proj1 f or f . b1 = g . b1 )

let a be object ; :: thesis: ( not a in proj1 f or f . a = g . a )
assume A3: a in dom f ; :: thesis: f . a = g . a
hence f . a = <*a*> by A1
.= g . a by A2, A3 ;
:: thesis: verum