let M be finite-degree Matroid; :: thesis: for A, B being Subset of M
for e being Element of M st A c= B & e is_dependent_on A holds
e is_dependent_on B

let A, B be Subset of M; :: thesis: for e being Element of M st A c= B & e is_dependent_on A holds
e is_dependent_on B

let e be Element of M; :: thesis: ( A c= B & e is_dependent_on A implies e is_dependent_on B )
assume that
A1: A c= B and
A2: Rnk (A \/ {e}) = Rnk A ; :: according to MATROID0:def 14 :: thesis: e is_dependent_on B
consider Ca being independent Subset of M such that
A3: Ca c= A and
A4: card Ca = Rnk A by Th18;
A5: Ca c= B by A1, A3;
B c= B \/ {e} by XBOOLE_1:7;
then Ca c= B \/ {e} by A5;
then consider E being independent Subset of M such that
A6: Ca c= E and
A7: E is_maximal_independent_in B \/ {e} by Th14;
A8: now :: thesis: not Rnk (B \/ {e}) = (Rnk B) + 1end;
A16: Rnk (B \/ {e}) <= (Rnk B) + 1 by Th26;
Rnk B <= Rnk (B \/ {e}) by Th26;
hence Rnk (B \/ {e}) = Rnk B by A16, A8, NAT_1:9; :: according to MATROID0:def 14 :: thesis: verum