Fri, 02 Jun 2000 17:47:03 +0200 added rtranclD, tranclD, irrefl_trancl_rD
oheimb [Fri, 02 Jun 2000 17:47:03 +0200] rev 9022
added rtranclD, tranclD, irrefl_trancl_rD
Fri, 02 Jun 2000 17:47:02 +0200 new theorems Always_Constrains_weaken and Always_Compl_Un_eq
paulson [Fri, 02 Jun 2000 17:47:02 +0200] rev 9021
new theorems Always_Constrains_weaken and Always_Compl_Un_eq
Fri, 02 Jun 2000 17:46:32 +0200 added split_eta_SetCompr2 (also to simpset), generalized SetCompr_Sigma_eq
oheimb [Fri, 02 Jun 2000 17:46:32 +0200] rev 9020
added split_eta_SetCompr2 (also to simpset), generalized SetCompr_Sigma_eq
Fri, 02 Jun 2000 17:46:16 +0200 new parent MultisetOrder and new results about multiset unions
paulson [Fri, 02 Jun 2000 17:46:16 +0200] rev 9019
new parent MultisetOrder and new results about multiset unions
Fri, 02 Jun 2000 17:45:32 +0200 added map_of_mapk_SomeI and weak_map_of_SomeI
oheimb [Fri, 02 Jun 2000 17:45:32 +0200] rev 9018
added map_of_mapk_SomeI and weak_map_of_SomeI
Fri, 02 Jun 2000 17:42:43 +0200 Many new theorems about multisets and their ordering, including basic
paulson [Fri, 02 Jun 2000 17:42:43 +0200] rev 9017
Many new theorems about multisets and their ordering, including basic laws like {#} <= M. Renamed union_comm to union_commute. Introduced the collection operator {# x:M. P x #}.
(0) -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip