let T be Tree; :: thesis: for C being Chain of T
for t being Element of T st t in C & not C is finite holds
ex t9 being Element of T st
( t9 in C & t is_a_proper_prefix_of t9 )

let C be Chain of T; :: thesis: for t being Element of T st t in C & not C is finite holds
ex t9 being Element of T st
( t9 in C & t is_a_proper_prefix_of t9 )

let t be Element of T; :: thesis: ( t in C & not C is finite implies ex t9 being Element of T st
( t9 in C & t is_a_proper_prefix_of t9 ) )

assume that
A1: t in C and
A2: not C is finite ; :: thesis: ex t9 being Element of T st
( t9 in C & t is_a_proper_prefix_of t9 )

now :: thesis: ex t9 being Element of T st
( t9 in C & t is_a_proper_prefix_of t9 )
end;
hence ex t9 being Element of T st
( t9 in C & t is_a_proper_prefix_of t9 ) ; :: thesis: verum