Debian Codegraph @

Library/finite_sets/CHANGES

raw
1 NOTE CONCERNING REVISIONS TO THE finite_sets LIBRARY
2 ----------------------------------------------------
3
4 The finite_sets library has been completely rewritten for HOL88
5 version 2.01. In particular, the library has been made as exactly
6 parallel as possible to the sets and pred_sets libraries, with the
7 same names for theorems, the same form of definitions, and a similar
8 manual.
9
10 Users of older versions of the library should note that:
11
12 * the MK_SET mechanism has been deleted
13 * some of the function constants have been made infixes
14 * the constant INTERSECT is now called INTER
15 * there are the following rough correspondences between
16 the old and new theorems and definitions
17
18
19 OLD NEW
20 =========================== ==============================
21
22 EMPTY_REP_DEF obsolete
23 INSERT_REP_DEF obsolete
24 IS_SET_REP slightly modified
25 set_ISO_DEF obsolete
26 EMPTY_DEF obsolete
27 IN obsolete
28 INSERT_DEF obsolete
29 UNION_P obsolete
30 UNION_DEF obsolete
31 INTERSECT_P obsolete
32 INTERSECT_DEF obsolete
33 DISJOINT see DISJOINT_DEF
34 DELETE_P obsolete
35 DELETE_DEF obsolete
36 CHOICE obsolete
37 REST see REST_DEF
38 DIFF_P obsolete
39 DIFF_DEF obsolete
40 SUBSET_MEMBER see SUBSET_DEF
41 PSUBSET see PSUBSET_DEF
42 MK_SET_P *********
43 MK_SET_DEF *********
44 SING see SING_DEF
45 HAS_CARD obsolete
46 CARD_DEF obsolete
47 INSERT_MULTIPLICITY see INSERT_INSERT
48 INSERT_ASSOC see INSERT_COMM
49 SET_EQ see EXTENSION
50 IN see NOT_IN_EMPTY, IN_INSERT
51 set_induction see FINITE_SET_DEF
52 SET_CASES_THM see SET_CASES
53 SET_DISTINCT see NOT_EMPTY_INSERT
54 NONEMPTY_MEMBER see MEMBER_NOT_EMPTY
55 set_induction_2 see SET_INDUCT
56 MEMBER_DECOMP see DECOMPOSITION
57 UNION see UNION_EMPTY, INSERT_UNION
58 UNION_IDENT see UNION_IDEMPOT
59 UNION_SYM see UNION_COMM
60 INTERSECT see INTER_EMPTY, INSERT_INTER
61 INTERSECT_ASSOC see INTER_ASSOC
62 INTERSECT_IDENT see INTER_IDEMPOT
63 INTERSECT_SYM see INTER_COMM
64 UNION_OVER_INTERSECT see UNION_OVER_INTER
65 INTERSECT_OVER_UNION see INTER_OVER_UNION
66 DISJOINT_MEMBER see IN_DISJOINT
67 DELETE_MEMBER see IN_DELETE
68 DELETE see EMPTY_DELETE, DELETE_INSERT
69 DELETE_DECOMPOSITION see INSERT_DELETE
70 DELETE_ABSORPTION see DELETE_NON_ELEMENT
71 CHOICE_MEMBER see CHOICE_DEF
72 CHOICE_DECOMPOSITION see CHOICE_INSERT_REST
73 CHOICE_NON_MEMBER see CHOICE_NOT_IN_REST
74 DIFF see DIFF_EMPTY, DIFF_INSERT
75 SUBSET see EMPTY_SUBSET, INSERT_SUBSET
76 SUBSET_INTERSECT see INTER_SUBSET
77 SUBSET_DELETE obsolete
78 SUBSET_INTERSECT_ABSORPTION see SUBSET_INTER_ABSORPTION
79 PSUBSET_TRANS see PSUBSET_DEF
80 PSUBSET_REFL see PSUBSET_IRREFL
81 PSUBSET_REST see REST_PSUBSET
82 IN_MK_SET **********
83 MK_SET **********
84 MK_SET_TRUE **********
85 MK_SET_FALSE **********
86 MK_SET_INTERSECT **********
87 MK_SET_DELETE **********
88 MK_SET_DIFF **********
89 MK_SET_OR **********
90 MK_SET_AND **********
91 SING_CHOICE see CHOICE_SING
92 SING_REST see SING_IFF_EMPTY_REST
93 SELECT_0 obsolete
94 DELETE_ABS see DELETE_NON_ELEMENT
95 MEMBER_IMP_NONEMPTY see MEMBER_NOT_EMPTY
96 IN_DEL_IMP see IN_DELETE
97 lemme3 obsolete
98 IN_INSERT see IN_INSERT
99 NOT_IN_SAME_SET obsolete
100 lemme3a obsolete
101 NOT_SYM obsolete
102 DEL_DEL see DELETE_DELETE
103 DISTINCT_SET see NOT_INSERT_EMPTY
104 CARD_EMPTY_lem obsolete
105 CARD_DEL obsolete
106 CARD_DEL_THM obsolete
107 HAS_CARD_INDUCT obsolete
108 UNIQUE_CARD obsolete
109 CARD_EX obsolete
110 CARD_EMPTY see CARD_EMPTY, CARD_DEF
111 EMPTY_0_EQ see CARD_EQ_0
112 INSERT_CARD obsolete
113 EX_SUC_CARD obsolete
114 CARD_INDUCT_THM obsolete
115 CARD see CARD_DEF
116 CARD_ABSORPTION see CARD_INSERT
117 CARD_INTERSECT see CARD_INTER_LESS_EQ
118 SING_CARD see SING_IFF_CARD1
119
120
121
122 The old version of finite_sets is contained in the directory OLD,
123 which will eventually be deleted.
124
125 T. Melham
126 February 1992