:: FUZZY_3 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
definition
let C1,
C2 be non
empty set ;
func Zmf C1,
C2 -> RMembership_Func of
C1,
C2 equals :: FUZZY_3:def 1
chi {} ,
[:C1,C2:];
correctness
coherence
chi {} ,[:C1,C2:] is RMembership_Func of C1,C2;
by FUZZY_1:13;
func Umf C1,
C2 -> RMembership_Func of
C1,
C2 equals :: FUZZY_3:def 2
chi [:C1,C2:],
[:C1,C2:];
correctness
coherence
chi [:C1,C2:],[:C1,C2:] is RMembership_Func of C1,C2;
by FUZZY_1:2;
end;
:: deftheorem defines Zmf FUZZY_3:def 1 :
:: deftheorem defines Umf FUZZY_3:def 2 :
theorem Th1: :: FUZZY_3:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th2: :: FUZZY_3:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: FUZZY_3:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: FUZZY_3:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
C1,
C2 being non
empty set for
f being
RMembership_Func of
C1,
C2 holds
(
max f,
(Umf C1,C2) = Umf C1,
C2 &
min f,
(Umf C1,C2) = f &
max f,
(Zmf C1,C2) = f &
min f,
(Zmf C1,C2) = Zmf C1,
C2 )
theorem :: FUZZY_3:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: FUZZY_3:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: FUZZY_3:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)