lcp [Thu, 12 Jan 1995 03:00:58 +0100] rev 850
Added constants Ord_alt, ++, **
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.
lcp [Wed, 11 Jan 1995 18:47:03 +0100] rev 848
Proved ord_isoI, ord_iso_refl. Simplified proof of
ord_iso_restrict_pred. Proved theorems irrefl_0, ..., well_ord_0.
lcp [Wed, 11 Jan 1995 18:42:06 +0100] rev 847
Proved cadd_cmult_distrib.
lcp [Wed, 11 Jan 1995 18:30:37 +0100] rev 846
Now proof of Ord_jump_cardinal uses
ordertype_pred_unfold; proof of sum_0_eqpoll uses bij_0_sum; proof of
sum_0_eqpoll uses sum_prod_distrib_bij; proof of sum_assoc_eqpoll uses
sum_assoc_bij; proof of prod_assoc_eqpoll uses prod_assoc_bij. Proved
well_ord_cadd_cmult_distrib.
lcp [Wed, 11 Jan 1995 18:21:39 +0100] rev 845
Added Krzysztof's theorem LeastI2. Proof of sum_eqpoll_cong
uses lemma sum_bij; proof of prod_eqpoll_cong uses lemma prod_bij.
wenzelm [Wed, 11 Jan 1995 13:25:23 +0100] rev 844
pretty_gram: now sorts productions;
wenzelm [Wed, 11 Jan 1995 10:57:39 +0100] rev 843
removed print_sign, print_axioms;
wenzelm [Wed, 11 Jan 1995 10:53:22 +0100] rev 842
slightly changed OFCLASS syntax;
wenzelm [Mon, 02 Jan 1995 12:16:12 +0100] rev 841
fixed minor typos;
wenzelm [Mon, 02 Jan 1995 12:14:26 +0100] rev 840
added;
lcp [Fri, 23 Dec 1994 16:51:10 +0100] rev 839
RepFun_eq_0_iff, RepFun_0: new
lcp [Fri, 23 Dec 1994 16:50:22 +0100] rev 838
Moved Transset_includes_summands and Transset_sum_Int_subset
here from Ordinal.ML
lcp [Fri, 23 Dec 1994 16:49:48 +0100] rev 837
Re-indented declarations; declared the number 2
lcp [Fri, 23 Dec 1994 16:35:42 +0100] rev 836
Added Krzysztof's theorems irrefl_converse, trans_on_converse,
part_ord_converse, linear_converse, tot_ord_converse,
Proved rvimage_converse, ord_iso_rvimage_eq
lcp [Fri, 23 Dec 1994 16:35:08 +0100] rev 835
Added Krzysztof's theorems irrefl_rvimage, trans_on_rvimage,
part_ord_rvimage, tot_ord_rvimage, irrefl_Int_iff, trans_on_Int_iff,
part_ord_Int_iff, linear_Int_iff, tot_ord_Int_iff, wf_on_Int_iff,
well_ord_Int_iff
lcp [Fri, 23 Dec 1994 16:34:27 +0100] rev 834
singleton_iff: new
lcp [Fri, 23 Dec 1994 16:33:37 +0100] rev 833
Proved cons_lepoll_consD, succ_lepoll_succD, cons_eqpoll_consD,
succ_eqpoll_succD, cons_lepoll_cons_iff, cons_eqpoll_cons_iff. Deleted
inj_succ_succD. Streamlined proof of nat_lepoll_imp_le_lemma. Added
Krzysztof's theorems diff_sing_lepoll, lepoll_diff_sing, diff_sing_eqpoll,
lepoll_1_is_sing, inj_not_surj_succ, lesspoll_trans, lesspoll_lepoll_lesspoll,
lepoll_lesspoll_lesspoll, lepoll_imp_lesspoll_succ, lesspoll_succ_imp_lepoll,
lepoll_succ_disj, lepoll_nat_imp_Finite, lepoll_Finite,
Finite_imp_cons_Finite, Finite_imp_succ_Finite, nat_le_infinite_Ord,
nat_wf_on_converse_Memrel, nat_well_ord_converse_Memrel, well_ord_converse,
ordertype_eq_n, Finite_well_ord_converse
lcp [Fri, 23 Dec 1994 16:32:39 +0100] rev 832
Added Krzysztof's constants lesspoll and Finite
lcp [Fri, 23 Dec 1994 16:32:02 +0100] rev 831
Added Krzysztof's theorem pred_Memrel
lcp [Fri, 23 Dec 1994 16:31:23 +0100] rev 830
Moved Transset_includes_summands and Transset_sum_Int_subset to
QUniv.thy to eliminate use of merge_theories. Proved Memrel_type.
Added Krzysztof's theorems Memrel_mono, Memrel_empty, lt_Ord, succ_le_imp_le
lcp [Fri, 23 Dec 1994 16:30:35 +0100] rev 829
natE0: deleted, since unused
lcp [Fri, 23 Dec 1994 16:29:53 +0100] rev 828
Changed succ(1) to 2 in in_VLimit, two_in_univ
lcp [Fri, 23 Dec 1994 16:29:04 +0100] rev 827
csquare_rel_def: renamed k to K
lcp [Fri, 23 Dec 1994 16:28:26 +0100] rev 826
inj_apply_equality: new
lcp [Fri, 23 Dec 1994 16:27:45 +0100] rev 825
Added Krzysztof's theorems subst_elem, not_emptyI, not_emptyE
lcp [Fri, 23 Dec 1994 16:27:07 +0100] rev 824
empty_fun: generalized from -> to Pi
lcp [Fri, 23 Dec 1994 16:26:34 +0100] rev 823
Changed succ(1) to 2 in cmult_2; Simplified proof of InfCard_is_Limit
lcp [Fri, 23 Dec 1994 16:25:45 +0100] rev 822
Added Krzysztof's theorems singleton_eq_iff, fst_type, snd_type
Renamed doubleton_iff to doubleton_eq_iff
lcp [Fri, 23 Dec 1994 10:52:25 +0100] rev 821
Added Krzysztof's theorem disj_imp_disj
lcp [Wed, 21 Dec 1994 13:36:02 +0100] rev 820
Id: marker.
lcp [Wed, 21 Dec 1994 13:26:26 +0100] rev 819
Added comments and Id: marker.
lcp [Wed, 21 Dec 1994 13:10:39 +0100] rev 818
Added comments and Id: marker.
lcp [Wed, 21 Dec 1994 12:53:45 +0100] rev 817
Tools description, largely taken from ../README
lcp [Wed, 21 Dec 1994 12:46:52 +0100] rev 816
Moved description of tools to Tools/README
lcp [Tue, 20 Dec 1994 16:20:50 +0100] rev 815
ord_iso_rvimage: new
lcp [Tue, 20 Dec 1994 15:58:52 +0100] rev 814
Moved well_ord_Memrel, lt_eq_pred, Ord_iso_implies_eq_lemma,
Ord_iso_implies_eq to top of file, as they do not require the other
material. Simplified proof of ordertype_subset.
Proved ordertype_eq: a short proof using deepen_tac! Deleted
bij_ordermap_vimage and ordermap_Memrel
"bij_ordermap_vimage and ordermap_Memrelf. [| f: bij(A,B); well_ord(B,r); x:A |] ==>\
\ ordermap(A,rvimage(A,f,r)) ` x = ordermap(B,r) ` (f`x)";
"\ ordermap(A,rvimage(A,f,r)) ` x = ordermap(B,r) ` (f`x)";i. [| Ord(i); j:i |] ==> ordermap(i,Memrel(i)) ` j = j"
because ordertype_eq serves the same purpose. Proofs of bij_ordertype_vimage
and ordertype_Memrel are now trivial.
clasohm [Tue, 20 Dec 1994 13:24:04 +0100] rev 813
qed is a utility that makes ML files store the defined theories in Isabelle's
theorem database
lcp [Tue, 20 Dec 1994 10:21:32 +0100] rev 812
Simplified proof of ord_iso_image_pred using bij_inverse_ss.
Replaced not_well_ord_iso_pred_lemma by much simpler well_ord_iso_subset_lemma.
Simplifed proof of well_ord_iso_unique_lemma using well_ord_iso_subset_lemma.
lcp [Tue, 20 Dec 1994 10:19:24 +0100] rev 811
Used bind_thm to store domain_rel_subset and range_rel_subset
lcp [Mon, 19 Dec 1994 15:30:30 +0100] rev 810
removed quotes around "Datatype",
and removed needless mention of [Q]Univ
lcp [Mon, 19 Dec 1994 15:22:42 +0100] rev 809
removed quotes around "Inductive"
lcp [Mon, 19 Dec 1994 15:17:29 +0100] rev 808
ran expandshort script
lcp [Mon, 19 Dec 1994 15:11:50 +0100] rev 807
ran expandshort script
lcp [Mon, 19 Dec 1994 13:24:58 +0100] rev 806
removed quotes around "Inductive"
lcp [Mon, 19 Dec 1994 13:18:54 +0100] rev 805
added true theory dependencies
lcp [Mon, 19 Dec 1994 13:01:30 +0100] rev 804
ran expandshort script
lcp [Fri, 16 Dec 1994 18:07:12 +0100] rev 803
changed useless "qed" calls for lemmas back to uses of "result",
and/or used "bind_thm" to declare the real results.
lcp [Fri, 16 Dec 1994 17:46:02 +0100] rev 802
Defines ZF theory sections (inductive, datatype) at the start/
Moved theory section code here from Inductive.ML and
Datatype.ML
lcp [Fri, 16 Dec 1994 17:44:09 +0100] rev 801
Added Limit_csucc from CardinalArith
Moved all theorems concerning FINITE functions to Univ.ML
and deleted the declaration
val Fin_Univ_thy = merge_theories (Univ.thy,Finite.thy);
lcp [Fri, 16 Dec 1994 17:41:49 +0100] rev 800
Limit_csucc: moved to InfDatatype and proved explicitly in
theory InfDatatype.thy
lcp [Fri, 16 Dec 1994 17:39:43 +0100] rev 799
put quotation marks around constant "and" because it is a
keyword for inductive definitions!!
lcp [Fri, 16 Dec 1994 17:38:14 +0100] rev 798
added thy_syntax.ML
lcp [Fri, 16 Dec 1994 17:36:50 +0100] rev 797
Defines ZF theory sections (inductive, datatype) at the start/
Moved theory section code here from Inductive.ML and
Datatype.ML
lcp [Fri, 16 Dec 1994 17:32:14 +0100] rev 796
now also depends upon Finite.thy
lcp [Fri, 16 Dec 1994 13:44:48 +0100] rev 795
converse_converse, converse_prod: renamed from
converse_of_converse, converse_of_prod
lcp [Fri, 16 Dec 1994 13:43:01 +0100] rev 794
moved congruence rule conj_cong2 to FOL/IFOL.ML
lcp [Fri, 16 Dec 1994 13:30:34 +0100] rev 793
conj_cong2: new congruence rule
lcp [Thu, 15 Dec 1994 11:50:53 +0100] rev 792
case_ss: now built upon ZF/Order/bij_inverse_ss. Deleted
own bij_inverse_ss and replaces uses by case_ss
lcp [Thu, 15 Dec 1994 11:17:49 +0100] rev 791
updated comment;
renamed converse_of_Un to converse_Un
lcp [Thu, 15 Dec 1994 11:08:22 +0100] rev 790
qconverse_qconverse, qconverse_prod: renamed from
qconverse_of_qconverse, qconverse_of_prod
lcp [Wed, 14 Dec 1994 17:24:23 +0100] rev 789
well_ord_iso_predE replaces not_well_ord_iso_pred
well_ord_iso_unique: eliminated a premise using well_ord_ord_iso
Proved well_ord_iso_pred_eq, ord_iso_image_pred, ord_iso_restrict_pred,
part_ord_ord_iso, linear_ord_iso, wf_on_ord_iso, well_ord_ord_iso,
well_ord_iso_preserving, mono_map_is_fun, mono_map_is_inj, mono_map_trans,
mono_ord_isoI, well_ord_mono_ord_isoI, ord_iso_is_mono_map,
ord_iso_map_mono_map, ord_iso_map_ord_iso, domain_ord_iso_map_subset,
domain_ord_iso_map_cases, range_ord_iso_map_cases, well_ord_trichotomy
deleted bij_ss in favour of bij_inverse_ss
lcp [Wed, 14 Dec 1994 17:15:54 +0100] rev 788
Ord_iso_implies_eq_lemma: uses well_ord_iso_predE instead of
not_well_ord_iso_pred
lcp [Wed, 14 Dec 1994 16:57:55 +0100] rev 787
converse_UN, Diff_eq_0_iff: new
lcp [Wed, 14 Dec 1994 16:54:13 +0100] rev 786
added constants mono_map, ord_iso_map
lcp [Wed, 14 Dec 1994 16:51:16 +0100] rev 785
cardinal_UN_Ord_lt_csucc: added comment
le_UN_Ord_lt_csucc: tided proof by proving the lemma
inj_UN_subset
lcp [Wed, 14 Dec 1994 16:48:36 +0100] rev 784
conj_commute,disj_commute: new
clasohm [Wed, 14 Dec 1994 13:03:09 +0100] rev 783
changed get_thm to search all parent theories if the theorem is not found
in the current theory
clasohm [Wed, 14 Dec 1994 11:41:49 +0100] rev 782
added bind_thm for theorems defined by "standard ..."
wenzelm [Wed, 14 Dec 1994 10:26:30 +0100] rev 781
added any, sprop to pure_types;
wenzelm [Wed, 14 Dec 1994 10:24:54 +0100] rev 780
removed "logic1";
improved typ_to_nonterm;
clasohm [Tue, 13 Dec 1994 11:51:12 +0100] rev 779
removed FOL_Lemmas and IFOL_Lemmas; added qed_goal
wenzelm [Mon, 12 Dec 1994 10:26:05 +0100] rev 778
added print_theory that prints stored thms;
wenzelm [Fri, 09 Dec 1994 16:44:31 +0100] rev 777
minor internal changes;
wenzelm [Fri, 09 Dec 1994 16:42:09 +0100] rev 776
improved axioms_of: returns thms as the manual says;
clasohm [Fri, 09 Dec 1994 13:39:52 +0100] rev 775
removed ZF_Lemmas and added qed_goal
clasohm [Fri, 09 Dec 1994 13:05:03 +0100] rev 774
added warning for already stored theorem to store_thm
lcp [Thu, 08 Dec 1994 16:42:58 +0100] rev 773
sum_ss: moved down and added the rewrite rules for "case"
lcp [Thu, 08 Dec 1994 16:07:12 +0100] rev 772
leI: added comment
lcp [Thu, 08 Dec 1994 15:37:28 +0100] rev 771
lt_eq_pred, Ord_iso_implies_eq: new, for Kunens Theorem 7.3
lcp [Thu, 08 Dec 1994 15:07:48 +0100] rev 770
sum_ss: deleted because it conflicts with the one in Sum.ML
lcp [Thu, 08 Dec 1994 14:38:58 +0100] rev 769
not_well_ord_iso_pred: removed needless quantifier
lcp [Thu, 08 Dec 1994 14:18:31 +0100] rev 768
UN_upper_cardinal: updated to refer to Card_le_imp_lepoll
and lepoll_imp_Card_le
lcp [Thu, 08 Dec 1994 14:06:16 +0100] rev 767
sum_lepoll_self, cadd_le_self, prod_lepoll_self,
cmult_le_self, sum_lepoll_mono, cadd_le_mono, prod_lepoll_mono,
cmult_le_mono, InfCard_cmult_eq, cmult_2: new
well_ord_lepoll_imp_le: renamed to well_ord_lepoll_imp_Card_le
lcp [Thu, 08 Dec 1994 13:53:28 +0100] rev 766
le_imp_lepoll: renamed to Card_le_imp_lepoll
lepoll_imp_le: renamed to lepoll_imp_Card_le;
updated to refer to well_ord_lepoll_imp_Card_le
lcp [Thu, 08 Dec 1994 13:38:13 +0100] rev 765
Card_cardinal_le: new
clasohm [Thu, 08 Dec 1994 12:46:25 +0100] rev 764
changed Pure's grammar and the way types are converted to nonterminals
clasohm [Thu, 08 Dec 1994 12:45:28 +0100] rev 763
replaced type_syn by pure_syn in Pure signature
lcp [Thu, 08 Dec 1994 11:28:34 +0100] rev 762
test_assume_tac: now tries eq_assume_tac on exceptional cases
(formulae not of the form a:?A). Affects typechk_tac.
lcp [Thu, 08 Dec 1994 11:26:25 +0100] rev 761
res_inst_tac: added comments
clasohm [Wed, 07 Dec 1994 13:12:04 +0100] rev 760
added qed and qed_goal[w]
clasohm [Wed, 07 Dec 1994 12:34:47 +0100] rev 759
moved first call of store_theory from thy_read.ML to created .thy.ML file
clasohm [Tue, 06 Dec 1994 12:50:13 +0100] rev 758
added bind_thm
clasohm [Wed, 30 Nov 1994 13:53:46 +0100] rev 757
added qed and qed_goal[w]
clasohm [Wed, 30 Nov 1994 13:18:42 +0100] rev 756
added qed_goal for meta_iffD
clasohm [Wed, 30 Nov 1994 13:13:52 +0100] rev 755
replaced "val ... = result()" by "qed ..."
lcp [Tue, 29 Nov 1994 11:51:07 +0100] rev 754
le_UN_Ord_lt_csucc: added comment
lcp [Tue, 29 Nov 1994 00:31:31 +0100] rev 753
replaced "rules" by "defs"
regensbu [Mon, 28 Nov 1994 19:48:30 +0100] rev 752
----------------------------------------------------------------------
Committing in HOLCF
Use new translation mechanism and keyword syntax, cinfix.ML no
longer needed.
Optimized proofs in Cont.ML
Modified Files:
Cfun1.ML Cfun2.thy Cont.ML Cprod3.thy Makefile README
Sprod3.thy Tr2.thy ccc1.thy
----------------------------------------------------------------------
lcp [Fri, 25 Nov 1994 11:13:55 +0100] rev 751
ZF/indrule/mutual_ind_tac: ensured that asm_full_simp_tac ignores any
equalities, by adding setmksimps K[].
ZF/indrule/mut_ss: removed Collect_cong; it is redundant.
lcp [Fri, 25 Nov 1994 11:08:12 +0100] rev 750
checks that the recursive sets are Consts before taking
them apart! Bug was introduced during the translation to theory sections.
lcp [Fri, 25 Nov 1994 11:04:44 +0100] rev 749
equiv_comp_eq: simplified proof
lcp [Fri, 25 Nov 1994 11:02:39 +0100] rev 748
moved Cantors theorem here from ZF/ex/misc
lcp [Fri, 25 Nov 1994 10:43:50 +0100] rev 747
deepen_tac: modified due to outcome of experiments. Its
choice of unsafe rule to expand is still non-deterministic.
clasohm [Fri, 25 Nov 1994 09:13:49 +0100] rev 746
added qed_goal[w]
lcp [Fri, 25 Nov 1994 00:02:37 +0100] rev 745
added blank line
lcp [Fri, 25 Nov 1994 00:01:04 +0100] rev 744
tidied proofs, using fast_tac etc. as much as possible
lcp [Fri, 25 Nov 1994 00:00:35 +0100] rev 743
prove_fun: new; no longer depends upon the version in simpdata.ML
lcp [Thu, 24 Nov 1994 10:57:24 +0100] rev 742
data_domain,Codata_domain: removed replicate; now return one
single domain
lcp [Thu, 24 Nov 1994 10:53:46 +0100] rev 741
tidied proofs, using fast_tac etc. as much as possible
lcp [Thu, 24 Nov 1994 10:47:45 +0100] rev 740
added comments on alternative uses of type_intrs/elims
lcp [Thu, 24 Nov 1994 10:38:08 +0100] rev 739
modified for new treatment of mutual recursion
lcp [Thu, 24 Nov 1994 10:31:47 +0100] rev 738
the_equality: more careful use of addSIs and addIs
lcp [Thu, 24 Nov 1994 10:23:41 +0100] rev 737
cons_fun_eq: modified strange uses of classical reasoner
lcp [Thu, 24 Nov 1994 00:33:13 +0100] rev 736
moved Cantors theorem to ZF/ZF.ML and ZF/Perm.ML
hom_tac: removed to simplify the proof of comp_homs
lcp [Thu, 24 Nov 1994 00:32:43 +0100] rev 735
moved version of Cantors theorem to ZF/Perm.ML
lcp [Thu, 24 Nov 1994 00:32:12 +0100] rev 734
ZF INDUCTIVE DEFINITIONS: Simplifying the type checking for mutually
recursive datatypes, especially with monotone operators
Inductive_Fun,CoInductive_Fun: deleted as obsolete
inductive_decl: now reads a SINGLE domain for the mutually
recursive construction. This could be a sum, perhaps not! CONCRETE SYNTAX
has changed too (but there are no examples of this to change).
lcp [Thu, 24 Nov 1994 00:31:41 +0100] rev 733
ZF/Datatype/datatype_decl: supplies a SINGLE domain for the mutually
recursive construction. This is [q]univ(A), which is closed under sum.
lcp [Thu, 24 Nov 1994 00:31:08 +0100] rev 732
updated for new deepen_tac
lcp [Thu, 24 Nov 1994 00:30:35 +0100] rev 731
trivial changes