1. wrap_terms added to null-refiner for postprocessing of tactic results 2. implementation of "new" local semantics of thenMT, thenWT, etc moved to tactic_boot 3. thenMLT and alike still not supported.

3.itt_field - original form of isField was incorrect, finally I added [i:l] to it because I say that car0 is equal to certain set. Still proof of isField_wf is incomplete yet and huge (it possibly means that itt_group*, itt_record* and itt_ring have imperfect design).

- ocamldep should not denerate .cmi/.cmo: .cmo dependencies when only .ml file is there, but no .mli is present. Instead, it should just generate the normal .cmi/.cmo: .cmi dependency (since .cmi is going to be build out of .ml)

- omake can _not_ use "-I $(ROOT)/lib" since things will not be in lib yet at dependency scan time.

- OCamlGeneratedFiles needs to be redefined for theory files to include .ppo dependencies.

1.isField is now defined using ext_equal for car0 (instead of equality in a universe). 2.I believe isField_wf is complete modulo some basic interplay between renaming and recordTop. Or my be I just push into a deadend.

Started (partial, etc) order theory. Currently we have to decide 3 issues:

1.I define relation[i,rel] where rel is the label for particular relation, so you can have relation[i,<=], relation[i,>], etc. Do you think it's a good idea or variable labels are not well
supported (or pain to use)

2.I defined propositional relation, may be it is better to define boolean relations, may be both.
Itt_int uses boolean relation as primitive one and propositional relations are "assert"s of booleans.

Added clarification how set_dfmode works, I write: It affects the output of functions that return terms immediately. For theory/proof listing you have to <TT>cd</TT> to "/" in order this change to take effect.

added: * "tac tatca" is a short for "tac thenAT tryT (completeT autoT)" * "tac twtca" is a short for "tac thenWT tryT (completeT autoT)" * "tac taa" is a short for "tac thenAT autoT" * "tac twa" is a short for "tac thenWT autoT"

Added two theorems(intro and elim style) about symmetry. Added two theorems that can replace equality in one type with equality in ext-equal type. May be last two rules should be added to elim-resource.

1.Itt_subtype - added 2 elim-style versions of subtypeTransitive. 2.Itt_ring,field - added 0<>1 condition to ring definition. It basically says that ring should have more than one element (that's why this
conditon called isNonDegenerated).
Actually I need this condition more for fields (to prove that 0 is not in car0)
but anyway I don't think that "zero ring" is an "interesting" object. Please let me know if you think that this condition better be in field definition.

Added reduce to appropriate rules. The list is maintained in the file I use to convert from KAT-ML and adds the automatically in the conversion. Also started to define Hoare rules in the standard way with ifs and whiles and to let MetaPRL do the conversion on its own.