let m be Element of NAT ; :: thesis: for S being non empty non void ManySortedSign
for s being SortSymbol of S
for o being OperSymbol of S
for Y being infinite-yielding ManySortedSet of the carrier of S
for q being Element of Args (o,(Free (S,Y)))
for V being finite set st m in dom q & (the_arity_of o) /. m = s holds
ex y being Element of Y . s ex C1 being context of y ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C1 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )

let S be non empty non void ManySortedSign ; :: thesis: for s being SortSymbol of S
for o being OperSymbol of S
for Y being infinite-yielding ManySortedSet of the carrier of S
for q being Element of Args (o,(Free (S,Y)))
for V being finite set st m in dom q & (the_arity_of o) /. m = s holds
ex y being Element of Y . s ex C1 being context of y ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C1 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )

let s be SortSymbol of S; :: thesis: for o being OperSymbol of S
for Y being infinite-yielding ManySortedSet of the carrier of S
for q being Element of Args (o,(Free (S,Y)))
for V being finite set st m in dom q & (the_arity_of o) /. m = s holds
ex y being Element of Y . s ex C1 being context of y ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C1 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )

let o be OperSymbol of S; :: thesis: for Y being infinite-yielding ManySortedSet of the carrier of S
for q being Element of Args (o,(Free (S,Y)))
for V being finite set st m in dom q & (the_arity_of o) /. m = s holds
ex y being Element of Y . s ex C1 being context of y ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C1 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )

let Y be infinite-yielding ManySortedSet of the carrier of S; :: thesis: for q being Element of Args (o,(Free (S,Y)))
for V being finite set st m in dom q & (the_arity_of o) /. m = s holds
ex y being Element of Y . s ex C1 being context of y ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C1 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )

let q be Element of Args (o,(Free (S,Y))); :: thesis: for V being finite set st m in dom q & (the_arity_of o) /. m = s holds
ex y being Element of Y . s ex C1 being context of y ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C1 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )

let V be finite set ; :: thesis: ( m in dom q & (the_arity_of o) /. m = s implies ex y being Element of Y . s ex C1 being context of y ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C1 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term ) )

assume Z0: ( m in dom q & (the_arity_of o) /. m = s ) ; :: thesis: ex y being Element of Y . s ex C1 being context of y ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C1 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )

set y = the Element of (Y . s) \ (V \/ (proj1 (rng (o -term q))));
A0: proj1 (rng (o -term q)) is finite by WAYBEL26:39;
then reconsider y = the Element of (Y . s) \ (V \/ (proj1 (rng (o -term q)))) as Element of Y . s by XBOOLE_0:def 5;
reconsider t = y -term as Element of (Free (S,Y)) ;
reconsider q1 = q +* (m,(y -term)) as Element of Args (o,(Free (S,Y))) by Z0, MSUALG_6:7;
A1: q1 is y -context_including
proof
take m ; :: according to MSAFREE5:def 24 :: thesis: ( m in dom q1 & q1 . m is context of y & ( for j being Nat
for t being Element of (Free (S,Y)) st j in dom q1 & j <> m & t = q1 . j holds
t is y -omitting ) )

thus m in dom q1 by Z0, FUNCT_7:30; :: thesis: ( q1 . m is context of y & ( for j being Nat
for t being Element of (Free (S,Y)) st j in dom q1 & j <> m & t = q1 . j holds
t is y -omitting ) )

thus q1 . m is context of y by Z0, FUNCT_7:31; :: thesis: for j being Nat
for t being Element of (Free (S,Y)) st j in dom q1 & j <> m & t = q1 . j holds
t is y -omitting

let j be Nat; :: thesis: for t being Element of (Free (S,Y)) st j in dom q1 & j <> m & t = q1 . j holds
t is y -omitting

let v be Element of (Free (S,Y)); :: thesis: ( j in dom q1 & j <> m & v = q1 . j implies v is y -omitting )
assume Z1: ( j in dom q1 & j <> m & v = q1 . j ) ; :: thesis: v is y -omitting
then A4: j in dom q by FUNCT_7:30;
then A2: ( v = q . j & q . j in rng q ) by Z1, FUNCT_7:32, FUNCT_1:def 3;
set d = the Element of Coim (v,[y,s]);
assume A7: Coim (v,[y,s]) <> {} ; :: according to MSAFREE5:def 21 :: thesis: contradiction
then A3: ( the Element of Coim (v,[y,s]) in dom v & v . the Element of Coim (v,[y,s]) in {[y,s]} ) by FUNCT_1:def 7;
reconsider d = the Element of Coim (v,[y,s]) as Element of dom v by A7, FUNCT_1:def 7;
consider k being Nat such that
A5: j = 1 + k by Z1, FINSEQ_3:25, NAT_1:10;
A6: v . d = [y,s] by A3, TARSKI:def 1;
j <= len q by A4, FINSEQ_3:25;
then ( <*k*> ^ d in dom (o -term q) & (o -term q) . (<*k*> ^ d) = v . d ) by A2, A5, TREES_4:11, TREES_4:12, NAT_1:13;
then [y,s] in rng (o -term q) by A6, FUNCT_1:def 3;
then y in proj1 (rng (o -term q)) by XTUPLE_0:def 12;
then y in V \/ (proj1 (rng (o -term q))) by XBOOLE_0:def 3;
hence contradiction by A0, XBOOLE_0:def 5; :: thesis: verum
end;
then reconsider C9 = o -term q1 as context of y by Th53;
take y ; :: thesis: ex C1 being context of y ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C1 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )

take C9 ; :: thesis: ex q1 being Element of Args (o,(Free (S,Y))) st
( y nin V & C9 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )

take q1 ; :: thesis: ( y nin V & C9 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )
y nin V \/ (proj1 (rng (o -term q))) by A0, XBOOLE_0:def 5;
hence y nin V by XBOOLE_0:def 3; :: thesis: ( C9 = o -term q1 & q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )
thus C9 = o -term q1 ; :: thesis: ( q1 = q +* (m,(y -term)) & q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )
thus q1 = q +* (m,(y -term)) ; :: thesis: ( q1 is y -context_including & m = y -context_pos_in q1 & y -context_in q1 = y -term )
thus q1 is y -context_including by A1; :: thesis: ( m = y -context_pos_in q1 & y -context_in q1 = y -term )
A7: q1 . m = y -term by Z0, FUNCT_7:31;
hence m = y -context_pos_in q1 by A1, CPI; :: thesis: y -context_in q1 = y -term
hence y -context_in q1 = y -term by A1, A7, Th71; :: thesis: verum