let S be OrderSortedSign; :: thesis: for X being V16() ManySortedSet of S
for o being OperSymbol of S
for x being FinSequence holds
( x in Args o,(ParsedTermsOSA X) iff ( x is FinSequence of TS (DTConOSA X) & OSSym o,X ==> roots x ) )

let X be V16() ManySortedSet of S; :: thesis: for o being OperSymbol of S
for x being FinSequence holds
( x in Args o,(ParsedTermsOSA X) iff ( x is FinSequence of TS (DTConOSA X) & OSSym o,X ==> roots x ) )

let o be OperSymbol of S; :: thesis: for x being FinSequence holds
( x in Args o,(ParsedTermsOSA X) iff ( x is FinSequence of TS (DTConOSA X) & OSSym o,X ==> roots x ) )

let x be FinSequence; :: thesis: ( x in Args o,(ParsedTermsOSA X) iff ( x is FinSequence of TS (DTConOSA X) & OSSym o,X ==> roots x ) )
set PTA = ParsedTermsOSA X;
hereby :: thesis: ( x is FinSequence of TS (DTConOSA X) & OSSym o,X ==> roots x implies x in Args o,(ParsedTermsOSA X) )
assume A1: x in Args o,(ParsedTermsOSA X) ; :: thesis: ( x is FinSequence of TS (DTConOSA X) & OSSym o,X ==> roots x )
then A2: x in ((the Sorts of (ParsedTermsOSA X) # ) * the Arity of S) . o by MSUALG_1:def 9;
hence x is FinSequence of TS (DTConOSA X) by Th5; :: thesis: OSSym o,X ==> roots x
x in (((ParsedTerms X) # ) * the Arity of S) . o by A1, MSUALG_1:def 9;
then reconsider x1 = x as FinSequence of TS (DTConOSA X) by Th5;
OSSym o,X ==> roots x1 by A2, Th7;
hence OSSym o,X ==> roots x ; :: thesis: verum
end;
assume that
A3: x is FinSequence of TS (DTConOSA X) and
A4: OSSym o,X ==> roots x ; :: thesis: x in Args o,(ParsedTermsOSA X)
reconsider x1 = x as FinSequence of TS (DTConOSA X) by A3;
x1 in (((ParsedTerms X) # ) * the Arity of S) . o by A4, Th7;
hence x in Args o,(ParsedTermsOSA X) by MSUALG_1:def 9; :: thesis: verum