let A be transitive RelStr ; :: thesis: for B, C being Subset of A
for s1 being FinSequence of A
for x being Element of A st s1 is C -desc_ordering & not x in C & B = C \/ {x} & ( for y being Element of A st y in C holds
y <= x ) holds
ex s2 being FinSequence of A st
( s2 = <*x*> ^ s1 & s2 is B -desc_ordering )

let B, C be Subset of A; :: thesis: for s1 being FinSequence of A
for x being Element of A st s1 is C -desc_ordering & not x in C & B = C \/ {x} & ( for y being Element of A st y in C holds
y <= x ) holds
ex s2 being FinSequence of A st
( s2 = <*x*> ^ s1 & s2 is B -desc_ordering )

let s1 be FinSequence of A; :: thesis: for x being Element of A st s1 is C -desc_ordering & not x in C & B = C \/ {x} & ( for y being Element of A st y in C holds
y <= x ) holds
ex s2 being FinSequence of A st
( s2 = <*x*> ^ s1 & s2 is B -desc_ordering )

let x be Element of A; :: thesis: ( s1 is C -desc_ordering & not x in C & B = C \/ {x} & ( for y being Element of A st y in C holds
y <= x ) implies ex s2 being FinSequence of A st
( s2 = <*x*> ^ s1 & s2 is B -desc_ordering ) )

assume that
A1: s1 is C -desc_ordering and
A2: ( not x in C & B = C \/ {x} & ( for y being Element of A st y in C holds
y <= x ) ) ; :: thesis: ex s2 being FinSequence of A st
( s2 = <*x*> ^ s1 & s2 is B -desc_ordering )

Rev (Rev s1) is C -desc_ordering by A1;
then Rev s1 is C -asc_ordering by Th75;
then consider s2 being FinSequence of A such that
A3: s2 = (Rev s1) ^ <*x*> and
A4: s2 is B -asc_ordering by ;
take Rev s2 ; :: thesis: ( Rev s2 = <*x*> ^ s1 & Rev s2 is B -desc_ordering )
thus Rev s2 = <*x*> ^ (Rev (Rev s1)) by
.= <*x*> ^ s1 ; :: thesis: Rev s2 is B -desc_ordering
thus Rev s2 is B -desc_ordering by ; :: thesis: verum