let S, T be non empty RelStr ; :: thesis: for D being Subset of S
for f being Function of S,T st ( ( ex_inf_of D,S & ex_inf_of f .: D,T ) or ( S is complete & S is antisymmetric & T is complete & T is antisymmetric ) ) & f is monotone holds
f . (inf D) <= inf (f .: D)
let D be Subset of S; :: thesis: for f being Function of S,T st ( ( ex_inf_of D,S & ex_inf_of f .: D,T ) or ( S is complete & S is antisymmetric & T is complete & T is antisymmetric ) ) & f is monotone holds
f . (inf D) <= inf (f .: D)
let f be Function of S,T; :: thesis: ( ( ( ex_inf_of D,S & ex_inf_of f .: D,T ) or ( S is complete & S is antisymmetric & T is complete & T is antisymmetric ) ) & f is monotone implies f . (inf D) <= inf (f .: D) )
assume ( ( ex_inf_of D,S & ex_inf_of f .: D,T ) or ( S is complete & S is antisymmetric & T is complete & T is antisymmetric ) ) ; :: thesis: ( not f is monotone or f . (inf D) <= inf (f .: D) )
then A1: ( ex_inf_of D,S & ex_inf_of f .: D,T ) by YELLOW_0:17;
assume A2: f is monotone ; :: thesis: f . (inf D) <= inf (f .: D)
inf D is_<=_than D by A1, YELLOW_0:def 10;
then f . (inf D) is_<=_than f .: D by A2, YELLOW_2:15;
hence f . (inf D) <= inf (f .: D) by A1, YELLOW_0:def 10; :: thesis: verum