let X be non empty set ; for R being RMembership_Func of X,X st R is transitive holds
R = TrCl R
let R be RMembership_Func of X,X; ( R is transitive implies R = TrCl R )
assume A1:
R is transitive
; R = TrCl R
for c being Element of [:X,X:] holds (TrCl R) . c <= R . c
proof
set Q =
{ (n iter R) where n is Element of NAT : n > 0 } ;
set RP =
RealPoset [.0,1.];
let c be
Element of
[:X,X:];
(TrCl R) . c <= R . c
for
b being
Element of
(RealPoset [.0,1.]) st
b in pi (
{ (n iter R) where n is Element of NAT : n > 0 } ,
c) holds
b <<= R . c
then A6:
R . c is_>=_than pi (
{ (n iter R) where n is Element of NAT : n > 0 } ,
c)
by LATTICE3:def 9;
{ (n iter R) where n is Element of NAT : n > 0 } c= the
carrier of
(FuzzyLattice [:X,X:])
then
(TrCl R) . c = "\/" (
(pi ( { (n iter R) where n is Element of NAT : n > 0 } ,c)),
(RealPoset [.0,1.]))
by Th32;
then
(TrCl R) . c <<= R . c
by A6, YELLOW_0:32;
hence
(TrCl R) . c <= R . c
by LFUZZY_0:3;
verum
end;
then A8:
R c=
;
TrCl R c=
by Th30;
hence
R = TrCl R
by A8, Th3; verum