theorem :: OSAFREE:16

for S being OrderSortedSign
for X being non-empty ManySortedSet of S
for s being Element of S
for x being set st x in X . s holds
for t being Element of TS (DTConOSA X) st t = root-tree [x,s] holds
LeastSort t = s