New ROOT file.

New example by Ole Rasmussen

Simplified some proofs and made them work for new hyp_subst_tac.

expandshort

Deleted some useless things and made proofs of refl_comp_subset and comp_equivI more like the versions in ZF/EquivClass.ML

Simplified using pattern replacements.

adjusted HOLCF for new hyp_subst_tac

Defined vv1 using let. Introduced gg1, gg2.

Deleted subset_imp_Un_Diff_eq, as it is identical to Diff_partition. Used split_tac (sometimes via simplifier) to apply expand_if. Replaced lt_oadd_disj1 by lt_oadd_odiff_disj, using ordinal difference instead of a description. Removed the outer quantifier from all_sum_lepoll_m, all_sum_lepoll_m_2. Changed all "lesspoll succ(m)" to "lepoll m" and simplified proofs. Changed definitions of vv1 and ww1 to use lepoll instead of lesspoll; therefore vv1(f,b,succ(m)) becomes vv1(f,b,m). Moved proof of vv1_not_0 into the body of the proof using this result. Renamed variable aa to s. Simplified lemma_iv using addss. Renamed some theorems; combined some proofs.

New root file

Redefined OUnion in a definitional manner

Redefined OUnion in a definitional manner, and proved the rules again. Deleted the rules OUnionI/E as they were not needed. Proved OUN_cong. Extended OrdQuant_ss with oex_cong and defined Ord_atomize to extract rewrite rules from ALL x<i... assumptions.

Deleted lt_oadd_disj1

Recoded function atomize so that new ways of creating simplification rules can be added easily.

Proved Int_Diff_eq.

fixed typo

Defined ordinal difference, --

Proved odiff_oadd_inverse, oadd_lt_cancel2, oadd_lt_iff2, odiff_lt_mono2. Deleted duplicate copy of oadd_le_mono.

Proved lesspoll_succ_iff.

Completely rewrote split_tac. The old one failed in strange circumstances.

term.ML: add_loose_bnos now returns a list w/o duplicates. pattern.ML: replaced null(loose_bnos t) by loose_bvar(t,0)

Added comment to function "loops".

(binder "Q" p) generates Binder("Q",p,p); it used to be Binder("Q",0,p).

ROOT.ML: Removed the "exit 1" calls, since now the Makefile does them. MT.thy: Deleted extra space in clos_mk.

Removed the "exit 1" calls, since now the Makefile does them.

ROOT.ML: installed new hyp_subst_tac Nat.ML: Changed proof of lessE for new hyp_subst_tac

Fixed bug in the simplifier: added uses of maxidx_of_term to make sure that the maxidx-filed of thms is computed correctly.

Local version of (original) hypsubst: needs no simplifier

Modified proofs for new hyp_subst_tac.

Modified proofs for new hyp_subst_tac, and simplified them.

Received some local definitions from AC_Equiv.thy.

Moved some local definitions to WO6_WO1.ML

Proved if_iff and used it to simplify proof of if_type.

Now the classical sets include UN_E, to avoid calling hyp_subst_tac

Changed proof of domain_ord_iso_map_subset for new hyp_subst_tac

Added Id: line

Deleted call to flexflex_tac

Added Id: line

Recoded with help from Toby to use rewriting instead of the subst rule -- the latter was too slow. But it must resort to the subst rule if the equality contains Vars.

Added comment.

No longer builds the induction structure (from ../Provers/ind.ML)

Loads the local hypsubst.ML. No longer loads ../Provers/ind.ML, which was never used.

Corrected many errors in the dependencies.

Changed comments and timings.

Updated comments.

Set up for new hyp_subst_tac.

Added Id: line

Fixed typo.

Simplified some proofs and made them work for new hyp_subst_tac.

Now sets loadpath.

Gave tighter priorities to SUM and PROD to reduce ambiguities.

Gave tighter priorities to if, napply and the let-forms to reduce ambiguities.

Now sets eta_contract.

Added Id: line

generalized map (%x.x) xs = xs to map (%x.x) = (%xs.xs)

replaced 'arities' by 'instance';