let R be transitive antisymmetric RelStr ; :: thesis: for X being Subset of R st X is finite holds
X is well_founded

let X be Subset of R; :: thesis: ( X is finite implies X is well_founded )
assume A1: X is finite ; :: thesis: X is well_founded
assume A2: not X is well_founded ; :: thesis: contradiction
then X <> {} R by Th11;
then A3: not R is empty ;
then consider f being sequence of R such that
A4: ( rng f c= X & f is descending ) by A2, Th12;
dom f = NAT by A3, FUNCT_2:def 1;
hence contradiction by A4, A1, A3, CARD_1:59; :: thesis: verum