:: FUZZY_1 semantic presentation

theorem Th1: :: FUZZY_1:1
for b1, b2 being set holds rng (chi b1,b2) c= [.0,1.]
proof end;

definition
let c1 be non empty set ;
mode Membership_Func of c1 -> PartFunc of a1, REAL means :Def1: :: FUZZY_1:def 1
( dom a2 = a1 & rng a2 c= [.0,1.] );
existence
ex b1 being PartFunc of c1, REAL st
( dom b1 = c1 & rng b1 c= [.0,1.] )
proof end;
end;

:: deftheorem Def1 defines Membership_Func FUZZY_1:def 1 :
for b1 being non empty set
for b2 being PartFunc of b1, REAL holds
( b2 is Membership_Func of b1 iff ( dom b2 = b1 & rng b2 c= [.0,1.] ) );

theorem Th2: :: FUZZY_1:2
for b1 being non empty set holds chi b1,b1 is Membership_Func of b1
proof end;

registration
let c1 be non empty set ;
cluster -> real-yielding Membership_Func of a1;
coherence
for b1 being Membership_Func of c1 holds b1 is real-yielding
;
end;

definition
let c1, c2 be real-yielding Function;
pred c1 is_less_than c2 means :Def2: :: FUZZY_1:def 2
( dom a1 c= dom a2 & ( for b1 being set st b1 in dom a1 holds
a1 . b1 <= a2 . b1 ) );
reflexivity
for b1 being real-yielding Function holds
( dom b1 c= dom b1 & ( for b2 being set st b2 in dom b1 holds
b1 . b2 <= b1 . b2 ) )
;
end;

:: deftheorem Def2 defines is_less_than FUZZY_1:def 2 :
for b1, b2 being real-yielding Function holds
( b1 is_less_than b2 iff ( dom b1 c= dom b2 & ( for b3 being set st b3 in dom b1 holds
b1 . b3 <= b2 . b3 ) ) );

notation
let c1 be non empty set ;
let c2, c3 be Membership_Func of c1;
synonym c2 c= c3 for c1 is_less_than c2;
end;

definition
let c1 be non empty set ;
let c2, c3 be Membership_Func of c1;
redefine pred is_less_than as c2 is_less_than c3 means :Def3: :: FUZZY_1:def 3
for b1 being Element of a1 holds a2 . b1 <= a3 . b1;
compatibility
( c2 is_less_than c3 iff for b1 being Element of c1 holds c2 . b1 <= c3 . b1 )
proof end;
end;

:: deftheorem Def3 defines is_less_than FUZZY_1:def 3 :
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds
( b2 is_less_than b3 iff for b4 being Element of b1 holds b2 . b4 <= b3 . b4 );

Lemma6: for b1 being non empty set
for b2, b3 being Membership_Func of b1 st b3 c= & b2 c= holds
b2 = b3
proof end;

theorem Th3: :: FUZZY_1:3
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds
( b2 = b3 iff ( b3 c= & b2 c= ) ) by Lemma6;

theorem Th4: :: FUZZY_1:4
for b1 being non empty set
for b2 being Membership_Func of b1 holds b2 c= ;

theorem Th5: :: FUZZY_1:5
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 st b3 c= & b4 c= holds
b4 c= ;

definition
let c1 be non empty set ;
let c2, c3 be Membership_Func of c1;
func min c2,c3 -> Membership_Func of a1 means :Def4: :: FUZZY_1:def 4
for b1 being Element of a1 holds a4 . b1 = min (a2 . b1),(a3 . b1);
existence
ex b1 being Membership_Func of c1 st
for b2 being Element of c1 holds b1 . b2 = min (c2 . b2),(c3 . b2)
proof end;
uniqueness
for b1, b2 being Membership_Func of c1 st ( for b3 being Element of c1 holds b1 . b3 = min (c2 . b3),(c3 . b3) ) & ( for b3 being Element of c1 holds b2 . b3 = min (c2 . b3),(c3 . b3) ) holds
b1 = b2
proof end;
idempotence
for b1 being Membership_Func of c1
for b2 being Element of c1 holds b1 . b2 = min (b1 . b2),(b1 . b2)
;
commutativity
for b1, b2, b3 being Membership_Func of c1 st ( for b4 being Element of c1 holds b1 . b4 = min (b2 . b4),(b3 . b4) ) holds
for b4 being Element of c1 holds b1 . b4 = min (b3 . b4),(b2 . b4)
;
end;

:: deftheorem Def4 defines min FUZZY_1:def 4 :
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 holds
( b4 = min b2,b3 iff for b5 being Element of b1 holds b4 . b5 = min (b2 . b5),(b3 . b5) );

definition
let c1 be non empty set ;
let c2, c3 be Membership_Func of c1;
func max c2,c3 -> Membership_Func of a1 means :Def5: :: FUZZY_1:def 5
for b1 being Element of a1 holds a4 . b1 = max (a2 . b1),(a3 . b1);
existence
ex b1 being Membership_Func of c1 st
for b2 being Element of c1 holds b1 . b2 = max (c2 . b2),(c3 . b2)
proof end;
uniqueness
for b1, b2 being Membership_Func of c1 st ( for b3 being Element of c1 holds b1 . b3 = max (c2 . b3),(c3 . b3) ) & ( for b3 being Element of c1 holds b2 . b3 = max (c2 . b3),(c3 . b3) ) holds
b1 = b2
proof end;
idempotence
for b1 being Membership_Func of c1
for b2 being Element of c1 holds b1 . b2 = max (b1 . b2),(b1 . b2)
;
commutativity
for b1, b2, b3 being Membership_Func of c1 st ( for b4 being Element of c1 holds b1 . b4 = max (b2 . b4),(b3 . b4) ) holds
for b4 being Element of c1 holds b1 . b4 = max (b3 . b4),(b2 . b4)
;
end;

:: deftheorem Def5 defines max FUZZY_1:def 5 :
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 holds
( b4 = max b2,b3 iff for b5 being Element of b1 holds b4 . b5 = max (b2 . b5),(b3 . b5) );

definition
let c1 be non empty set ;
let c2 be Membership_Func of c1;
func 1_minus c2 -> Membership_Func of a1 means :Def6: :: FUZZY_1:def 6
for b1 being Element of a1 holds a3 . b1 = 1 - (a2 . b1);
existence
ex b1 being Membership_Func of c1 st
for b2 being Element of c1 holds b1 . b2 = 1 - (c2 . b2)
proof end;
uniqueness
for b1, b2 being Membership_Func of c1 st ( for b3 being Element of c1 holds b1 . b3 = 1 - (c2 . b3) ) & ( for b3 being Element of c1 holds b2 . b3 = 1 - (c2 . b3) ) holds
b1 = b2
proof end;
involutiveness
for b1, b2 being Membership_Func of c1 st ( for b3 being Element of c1 holds b1 . b3 = 1 - (b2 . b3) ) holds
for b3 being Element of c1 holds b2 . b3 = 1 - (b1 . b3)
proof end;
end;

:: deftheorem Def6 defines 1_minus FUZZY_1:def 6 :
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds
( b3 = 1_minus b2 iff for b4 being Element of b1 holds b3 . b4 = 1 - (b2 . b4) );

theorem Th6: :: FUZZY_1:6
for b1 being non empty set
for b2 being Element of b1
for b3, b4 being Membership_Func of b1 holds
( min (b3 . b2),(b4 . b2) = (min b3,b4) . b2 & max (b3 . b2),(b4 . b2) = (max b3,b4) . b2 ) by Def4, Def5;

theorem Th7: :: FUZZY_1:7
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 holds
( max b2,b2 = b2 & min b2,b2 = b2 & max b2,b2 = min b2,b2 & min b3,b4 = min b4,b3 & max b3,b4 = max b4,b3 ) ;

theorem Th8: :: FUZZY_1:8
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 holds
( max (max b2,b3),b4 = max b2,(max b3,b4) & min (min b2,b3),b4 = min b2,(min b3,b4) )
proof end;

theorem Th9: :: FUZZY_1:9
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds
( max b2,(min b2,b3) = b2 & min b2,(max b2,b3) = b2 )
proof end;

theorem Th10: :: FUZZY_1:10
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 holds
( min b2,(max b3,b4) = max (min b2,b3),(min b2,b4) & max b2,(min b3,b4) = min (max b2,b3),(max b2,b4) )
proof end;

theorem Th11: :: FUZZY_1:11
for b1 being non empty set
for b2 being Membership_Func of b1 holds 1_minus (1_minus b2) = b2 ;

theorem Th12: :: FUZZY_1:12
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds
( 1_minus (max b2,b3) = min (1_minus b2),(1_minus b3) & 1_minus (min b2,b3) = max (1_minus b2),(1_minus b3) )
proof end;

theorem Th13: :: FUZZY_1:13
for b1 being non empty set holds chi {} ,b1 is Membership_Func of b1
proof end;

definition
let c1 be non empty set ;
func EMF c1 -> Membership_Func of a1 equals :: FUZZY_1:def 7
chi {} ,a1;
correctness
coherence
chi {} ,c1 is Membership_Func of c1
;
by Th13;
end;

:: deftheorem Def7 defines EMF FUZZY_1:def 7 :
for b1 being non empty set holds EMF b1 = chi {} ,b1;

definition
let c1 be non empty set ;
func UMF c1 -> Membership_Func of a1 equals :: FUZZY_1:def 8
chi a1,a1;
correctness
coherence
chi c1,c1 is Membership_Func of c1
;
by Th2;
end;

:: deftheorem Def8 defines UMF FUZZY_1:def 8 :
for b1 being non empty set holds UMF b1 = chi b1,b1;

theorem Th14: :: FUZZY_1:14
for b1 being non empty set
for b2, b3 being Element of REAL
for b4 being PartFunc of b1, REAL st rng b4 c= [.b2,b3.] & b2 <= b3 holds
for b5 being Element of b1 st b5 in dom b4 holds
( b2 <= b4 . b5 & b4 . b5 <= b3 )
proof end;

theorem Th15: :: FUZZY_1:15
for b1 being non empty set
for b2 being Membership_Func of b1 holds b2 c=
proof end;

theorem Th16: :: FUZZY_1:16
for b1 being non empty set
for b2 being Membership_Func of b1 holds UMF b1 c=
proof end;

theorem Th17: :: FUZZY_1:17
for b1 being non empty set
for b2 being Element of b1
for b3 being Membership_Func of b1 holds
( (EMF b1) . b2 <= b3 . b2 & b3 . b2 <= (UMF b1) . b2 )
proof end;

theorem Th18: :: FUZZY_1:18
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds
( b2 c= & max b2,b3 c= )
proof end;

theorem Th19: :: FUZZY_1:19
for b1 being non empty set
for b2 being Membership_Func of b1 holds
( max b2,(UMF b1) = UMF b1 & min b2,(UMF b1) = b2 & max b2,(EMF b1) = b2 & min b2,(EMF b1) = EMF b1 )
proof end;

theorem Th20: :: FUZZY_1:20
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 st b3 c= & b3 c= holds
b3 c=
proof end;

theorem Th21: :: FUZZY_1:21
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 st b3 c= holds
max b3,b4 c=
proof end;

theorem Th22: :: FUZZY_1:22
for b1 being non empty set
for b2, b3, b4, b5 being Membership_Func of b1 st b3 c= & b5 c= holds
max b3,b5 c=
proof end;

theorem Th23: :: FUZZY_1:23
for b1 being non empty set
for b2, b3 being Membership_Func of b1 st b3 c= holds
max b2,b3 = b3
proof end;

theorem Th24: :: FUZZY_1:24
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds max b2,b3 c=
proof end;

theorem Th25: :: FUZZY_1:25
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 st b3 c= & b4 c= holds
min b3,b4 c=
proof end;

theorem Th26: :: FUZZY_1:26
for b1, b2, b3, b4 being Element of REAL st b1 <= b2 & b3 <= b4 holds
min b1,b3 <= min b2,b4
proof end;

theorem Th27: :: FUZZY_1:27
for b1, b2, b3 being Element of REAL st b1 <= b2 holds
min b1,b3 <= min b2,b3 by Th26;

theorem Th28: :: FUZZY_1:28
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 st b3 c= holds
min b3,b4 c=
proof end;

theorem Th29: :: FUZZY_1:29
for b1 being non empty set
for b2, b3, b4, b5 being Membership_Func of b1 st b3 c= & b5 c= holds
min b3,b5 c=
proof end;

theorem Th30: :: FUZZY_1:30
for b1 being non empty set
for b2, b3 being Membership_Func of b1 st b3 c= holds
min b2,b3 = b2
proof end;

theorem Th31: :: FUZZY_1:31
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 st b3 c= & b4 c= & min b3,b4 = EMF b1 holds
b2 = EMF b1
proof end;

theorem Th32: :: FUZZY_1:32
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 st max (min b2,b3),(min b2,b4) = b2 holds
max b3,b4 c=
proof end;

theorem Th33: :: FUZZY_1:33
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 st b3 c= & min b3,b4 = EMF b1 holds
min b2,b4 = EMF b1
proof end;

theorem Th34: :: FUZZY_1:34
for b1 being non empty set
for b2 being Membership_Func of b1 st EMF b1 c= holds
b2 = EMF b1
proof end;

theorem Th35: :: FUZZY_1:35
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds
( max b2,b3 = EMF b1 iff ( b2 = EMF b1 & b3 = EMF b1 ) )
proof end;

theorem Th36: :: FUZZY_1:36
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 holds
( b2 = max b3,b4 iff ( b2 c= & b2 c= & ( for b5 being Membership_Func of b1 st b5 c= & b5 c= holds
b5 c= ) ) )
proof end;

theorem Th37: :: FUZZY_1:37
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 holds
( b2 = min b3,b4 iff ( b3 c= & b4 c= & ( for b5 being Membership_Func of b1 st b3 c= & b4 c= holds
b2 c= ) ) )
proof end;

theorem Th38: :: FUZZY_1:38
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 st max b3,b4 c= & min b2,b4 = EMF b1 holds
b3 c=
proof end;

Lemma25: for b1 being non empty set
for b2, b3 being Membership_Func of b1 st b3 c= holds
1_minus b2 c=
proof end;

theorem Th39: :: FUZZY_1:39
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds
( b3 c= iff 1_minus b2 c= )
proof end;

theorem Th40: :: FUZZY_1:40
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds
( 1_minus b3 c= iff 1_minus b2 c= )
proof end;

theorem Th41: :: FUZZY_1:41
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds 1_minus b2 c=
proof end;

theorem Th42: :: FUZZY_1:42
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds 1_minus (min b2,b3) c=
proof end;

theorem Th43: :: FUZZY_1:43
for b1 being non empty set
for b2 being Element of b1 holds
( (EMF b1) . b2 = 0 & (UMF b1) . b2 = 1 ) by FUNCT_3:def 3;

theorem Th44: :: FUZZY_1:44
for b1 being non empty set holds
( 1_minus (EMF b1) = UMF b1 & 1_minus (UMF b1) = EMF b1 )
proof end;

definition
let c1 be non empty set ;
let c2, c3 be Membership_Func of c1;
func c2 \+\ c3 -> Membership_Func of a1 equals :: FUZZY_1:def 9
max (min a2,(1_minus a3)),(min (1_minus a2),a3);
coherence
max (min c2,(1_minus c3)),(min (1_minus c2),c3) is Membership_Func of c1
;
commutativity
for b1, b2, b3 being Membership_Func of c1 st b1 = max (min b2,(1_minus b3)),(min (1_minus b2),b3) holds
b1 = max (min b3,(1_minus b2)),(min (1_minus b3),b2)
;
end;

:: deftheorem Def9 defines \+\ FUZZY_1:def 9 :
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds b2 \+\ b3 = max (min b2,(1_minus b3)),(min (1_minus b2),b3);

theorem Th45: :: FUZZY_1:45
for b1 being non empty set
for b2 being Membership_Func of b1 holds b2 \+\ (EMF b1) = b2
proof end;

theorem Th46: :: FUZZY_1:46
for b1 being non empty set
for b2 being Membership_Func of b1 holds b2 \+\ (UMF b1) = 1_minus b2
proof end;

theorem Th47: :: FUZZY_1:47
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 holds min (min (max b2,b3),(max b3,b4)),(max b4,b2) = max (max (min b2,b3),(min b3,b4)),(min b4,b2)
proof end;

theorem Th48: :: FUZZY_1:48
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds 1_minus (b2 \+\ b3) c=
proof end;

theorem Th49: :: FUZZY_1:49
for b1 being non empty set
for b2, b3 being Membership_Func of b1 holds max b2,b3 c=
proof end;

theorem Th50: :: FUZZY_1:50
for b1 being non empty set
for b2 being Membership_Func of b1 holds b2 \+\ b2 = min b2,(1_minus b2) ;

definition
let c1 be non empty set ;
let c2, c3 be Membership_Func of c1;
func ab_difMF c2,c3 -> Membership_Func of a1 means :: FUZZY_1:def 10
for b1 being Element of a1 holds a4 . b1 = abs ((a2 . b1) - (a3 . b1));
existence
ex b1 being Membership_Func of c1 st
for b2 being Element of c1 holds b1 . b2 = abs ((c2 . b2) - (c3 . b2))
proof end;
uniqueness
for b1, b2 being Membership_Func of c1 st ( for b3 being Element of c1 holds b1 . b3 = abs ((c2 . b3) - (c3 . b3)) ) & ( for b3 being Element of c1 holds b2 . b3 = abs ((c2 . b3) - (c3 . b3)) ) holds
b1 = b2
proof end;
end;

:: deftheorem Def10 defines ab_difMF FUZZY_1:def 10 :
for b1 being non empty set
for b2, b3, b4 being Membership_Func of b1 holds
( b4 = ab_difMF b2,b3 iff for b5 being Element of b1 holds b4 . b5 = abs ((b2 . b5) - (b3 . b5)) );