:: MSSUBFAM semantic presentation
theorem Th1: :: MSSUBFAM:1
theorem Th2: :: MSSUBFAM:2
theorem Th3: :: MSSUBFAM:3
theorem Th4: :: MSSUBFAM:4
theorem Th5: :: MSSUBFAM:5
theorem Th6: :: MSSUBFAM:6
theorem Th7: :: MSSUBFAM:7
theorem Th8: :: MSSUBFAM:8
theorem Th9: :: MSSUBFAM:9
theorem Th10: :: MSSUBFAM:10
theorem Th11: :: MSSUBFAM:11
theorem Th12: :: MSSUBFAM:12
theorem Th13: :: MSSUBFAM:13
theorem Th14: :: MSSUBFAM:14
theorem Th15: :: MSSUBFAM:15
theorem Th16: :: MSSUBFAM:16
theorem Th17: :: MSSUBFAM:17
theorem Th18: :: MSSUBFAM:18
theorem Th19: :: MSSUBFAM:19
theorem Th20: :: MSSUBFAM:20
theorem Th21: :: MSSUBFAM:21
theorem Th22: :: MSSUBFAM:22
theorem Th23: :: MSSUBFAM:23
theorem Th24: :: MSSUBFAM:24
theorem Th25: :: MSSUBFAM:25
theorem Th26: :: MSSUBFAM:26
theorem Th27: :: MSSUBFAM:27
theorem Th28: :: MSSUBFAM:28
theorem Th29: :: MSSUBFAM:29
theorem Th30: :: MSSUBFAM:30
theorem Th31: :: MSSUBFAM:31
theorem Th32: :: MSSUBFAM:32
theorem Th33: :: MSSUBFAM:33
theorem Th34: :: MSSUBFAM:34
theorem Th35: :: MSSUBFAM:35
theorem Th36: :: MSSUBFAM:36
theorem Th37: :: MSSUBFAM:37
theorem Th38: :: MSSUBFAM:38
theorem Th39: :: MSSUBFAM:39
theorem Th40: :: MSSUBFAM:40
:: deftheorem Def1 MSSUBFAM:def 1 :
canceled;
:: deftheorem Def2 defines meet MSSUBFAM:def 2 :
theorem Th41: :: MSSUBFAM:41
theorem Th42: :: MSSUBFAM:42
theorem Th43: :: MSSUBFAM:43
theorem Th44: :: MSSUBFAM:44
theorem Th45: :: MSSUBFAM:45
theorem Th46: :: MSSUBFAM:46
theorem Th47: :: MSSUBFAM:47
theorem Th48: :: MSSUBFAM:48
theorem Th49: :: MSSUBFAM:49
theorem Th50: :: MSSUBFAM:50
theorem Th51: :: MSSUBFAM:51
theorem Th52: :: MSSUBFAM:52
theorem Th53: :: MSSUBFAM:53
:: deftheorem Def3 defines additive MSSUBFAM:def 3 :
:: deftheorem Def4 defines absolutely-additive MSSUBFAM:def 4 :
:: deftheorem Def5 defines multiplicative MSSUBFAM:def 5 :
:: deftheorem Def6 defines absolutely-multiplicative MSSUBFAM:def 6 :
:: deftheorem Def7 defines properly-upper-bound MSSUBFAM:def 7 :
:: deftheorem Def8 defines properly-lower-bound MSSUBFAM:def 8 :
Lemma120:
for I being set
for M being ManySortedSet of I holds
( bool M is additive & bool M is absolutely-additive & bool M is multiplicative & bool M is absolutely-multiplicative & bool M is properly-upper-bound & bool M is properly-lower-bound )