let x be set ; :: thesis: for v being FinSequence holds ProperPrefixes (v ^ <*x*>) = (ProperPrefixes v) \/ {v}
let v be FinSequence; :: thesis: ProperPrefixes (v ^ <*x*>) = (ProperPrefixes v) \/ {v}
thus ProperPrefixes (v ^ <*x*>) c= (ProperPrefixes v) \/ {v} :: according to XBOOLE_0:def 10 :: thesis: (ProperPrefixes v) \/ {v} c= ProperPrefixes (v ^ <*x*>)
proof end;
let y be set ; :: according to TARSKI:def 3 :: thesis: ( not y in (ProperPrefixes v) \/ {v} or y in ProperPrefixes (v ^ <*x*>) )
assume A7: y in (ProperPrefixes v) \/ {v} ; :: thesis: y in ProperPrefixes (v ^ <*x*>)
A8: ( y in ProperPrefixes v or y in {v} ) by A7, XBOOLE_0:def 3;
A9: now end;
A15: v ^ {} = v by FINSEQ_1:47;
A16: ( v is_a_prefix_of v ^ <*x*> & v <> v ^ <*x*> ) by A15, FINSEQ_1:46, TREES_1:8;
A17: v is_a_proper_prefix_of v ^ <*x*> by A16, XBOOLE_0:def 8;
A18: ( y in ProperPrefixes v or ( y = v & v in ProperPrefixes (v ^ <*x*>) ) ) by A8, A17, TARSKI:def 1, TREES_1:def 4;
thus y in ProperPrefixes (v ^ <*x*>) by A9, A18; :: thesis: verum