let A, B be ManySortedFunction of FreeGen X,X; :: thesis: ( ( for s being SortSymbol of S holds A . s = Reverse (s,X) ) & ( for s being SortSymbol of S holds B . s = Reverse (s,X) ) implies A = B )

assume that

A3: for s being SortSymbol of S holds A . s = Reverse (s,X) and

A4: for s being SortSymbol of S holds B . s = Reverse (s,X) ; :: thesis: A = B

for i being object st i in the carrier of S holds

A . i = B . i

assume that

A3: for s being SortSymbol of S holds A . s = Reverse (s,X) and

A4: for s being SortSymbol of S holds B . s = Reverse (s,X) ; :: thesis: A = B

for i being object st i in the carrier of S holds

A . i = B . i

proof

hence
A = B
; :: thesis: verum
let i be object ; :: thesis: ( i in the carrier of S implies A . i = B . i )

assume i in the carrier of S ; :: thesis: A . i = B . i

then reconsider s = i as SortSymbol of S ;

A . s = Reverse (s,X) by A3;

hence A . i = B . i by A4; :: thesis: verum

end;assume i in the carrier of S ; :: thesis: A . i = B . i

then reconsider s = i as SortSymbol of S ;

A . s = Reverse (s,X) by A3;

hence A . i = B . i by A4; :: thesis: verum