let S be non empty non void ManySortedSign ; :: thesis: for X being V5() ManySortedSet of the carrier of S
for s being SortSymbol of S holds FreeGen (s,X) = { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) }

let X be V5() ManySortedSet of the carrier of S; :: thesis: for s being SortSymbol of S holds FreeGen (s,X) = { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) }
let s be SortSymbol of S; :: thesis: FreeGen (s,X) = { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) }
set D = DTConMSA X;
set A = { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) } ;
thus FreeGen (s,X) c= { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) } :: according to XBOOLE_0:def 10 :: thesis: { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) } c= FreeGen (s,X)
proof
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in FreeGen (s,X) or x in { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) } )
assume x in FreeGen (s,X) ; :: thesis: x in { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) }
then consider a being set such that
A1: a in X . s and
A2: x = root-tree [a,s] by Def15;
A3: [a,s] in Terminals () by ;
then reconsider t = [a,s] as Symbol of () ;
t `2 = s ;
hence x in { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) } by A2, A3; :: thesis: verum
end;
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) } or x in FreeGen (s,X) )
assume x in { () where t is Symbol of () : ( t in Terminals () & t `2 = s ) } ; :: thesis: x in FreeGen (s,X)
then consider t being Symbol of () such that
A4: x = root-tree t and
A5: t in Terminals () and
A6: t `2 = s ;
consider s1 being SortSymbol of S, a being set such that
A7: a in X . s1 and
A8: t = [a,s1] by ;
s = s1 by A6, A8;
hence x in FreeGen (s,X) by A4, A7, A8, Def15; :: thesis: verum