Thu, 12 Jan 1995 03:04:10 +0100 Proved case_cong and case_case.
lcp [Thu, 12 Jan 1995 03:04:10 +0100] rev 858
Proved case_cong and case_case.
Thu, 12 Jan 1995 03:03:45 +0100 Renamed single_fun to singleton_fun.
lcp [Thu, 12 Jan 1995 03:03:45 +0100] rev 857
Renamed single_fun to singleton_fun.
Thu, 12 Jan 1995 03:03:25 +0100 Now also depends upon equalities.thy, allowing use of the
lcp [Thu, 12 Jan 1995 03:03:25 +0100] rev 856
Now also depends upon equalities.thy, allowing use of the equalities in standard simpsets.
Thu, 12 Jan 1995 03:03:07 +0100 Added singleton_iff, Sigma_empty1, Sigma_empty2, Collect_simps
lcp [Thu, 12 Jan 1995 03:03:07 +0100] rev 855
Added singleton_iff, Sigma_empty1, Sigma_empty2, Collect_simps and UnInt_simps to ZF_ss. Added consI1 to ZF_typechecks.
Thu, 12 Jan 1995 03:02:34 +0100 Removed spurious comment about eq_cs
lcp [Thu, 12 Jan 1995 03:02:34 +0100] rev 854
Removed spurious comment about eq_cs
Thu, 12 Jan 1995 03:02:05 +0100 Moved theorems Ord_cases_lemma and Ord_cases to Ordinal.ML
lcp [Thu, 12 Jan 1995 03:02:05 +0100] rev 853
Moved theorems Ord_cases_lemma and Ord_cases to Ordinal.ML
Thu, 12 Jan 1995 03:01:40 +0100 Now depends upon Bool, so that 1 and 2 are defined
lcp [Thu, 12 Jan 1995 03:01:40 +0100] rev 852
Now depends upon Bool, so that 1 and 2 are defined
Thu, 12 Jan 1995 03:01:20 +0100 Moved theorems Ord_cases_lemma and Ord_cases here from Univ,
lcp [Thu, 12 Jan 1995 03:01:20 +0100] rev 851
Moved theorems Ord_cases_lemma and Ord_cases here from Univ, strengthening the succ(j) case to include Ord(j). Proved trans_induct3, le_implies_UN_le_UN, Ord_1, lt_Ord2, le_Ord2.
Thu, 12 Jan 1995 03:00:58 +0100 Added constants Ord_alt, ++, **
lcp [Thu, 12 Jan 1995 03:00:58 +0100] rev 850
Added constants Ord_alt, ++, **
Thu, 12 Jan 1995 03:00:38 +0100 Proved equivalence of Ord and Ord_alt. Proved
lcp [Thu, 12 Jan 1995 03:00:38 +0100] rev 849
Proved equivalence of Ord and Ord_alt. Proved ordertype_eq_imp_ord_iso, le_well_ord_Memrel, le_ordertype_Memrel, lt_oadd1, oadd_le_self, bij_0_sum, oadd_0, oadd_assoc, id_ord_iso_Memrel, ordertype_0. Now well_ord_Memrel follows from le_well_ord_Memrel and ordertype_Memrel follows from le_ordertype_Memrel. Proved simpler versions of Krzysztof's theorems Ord_oadd, ordertype_pred_subset, ordertype_pred_lt, ordertype_pred_unfold, bij_sum_0, bij_sum_succ, ordertype_sum_Memrel, lt_oadd_disj, oadd_inject. Deleted ordertype_subset: subsumed by ordertype_pred_unfold. Proved ordinal multiplication theorems Ord_omult, lt_omult, omult_oadd_lt, omult_unfold, omult_0, omult_0_left, omult_1, omult_1_left, oadd_omult_distrib, omult_succ, omult_assoc, omult_UN, omult_Limit, lt_omult1, omult_le_self, omult_le_mono1, omult_lt_mono2, omult_le_mono2, omult_le_mono, omult_lt_mono, omult_le_self2, omult_inject.
(0) -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip