theorem
  for T being finite-order Tree st
  for n ex C being finite Chain of T st card C = n
  ex B being Chain of T st not B is finite
proof
  let T be finite-order Tree;
 for t being Element of T holds succ t is finite;
  hence thesis by Th29;
end;
