Tidy pair{Script,Theory,Simps} to have less cruft

In particular, it's desirable to reduce the number of calls to
augment_srw_ss outside of Script files.

Update src for strip_binop change

Make pair induction principle work with Induct_on

Closes #765

Move DefnBase to src/coretypes, make progress with one_line_ify

DefnBase is now home to the updated literal-decider conversion

Make equality of "tight" precedence by default

Start to work through knock-on effects of this.

Fix a bunch of breakages caused by assuming term to be an eqtype

Remove TABs from src

Will also make selftest to check that they aren't introduced

Generate "standard" datatype simpl rewrites as tyinfos are loaded

This saves us from having to write them out to disk, which can make
for unnecessarily large theory.dat files.

Use TypeBase.export to avoid adjoin_to_theory calls

Still need to use the same facility in the implementation of Datatype.

Move smpp to Portable - get everything up to arithmeticScript working

Rename TypeBase entrypoints for caseeqsplit and friends

Now use case_eq everywhere.

Work on github issue #345

Automatically prove "case-eqsplit" theorems and store in TypeBase

For :num, this theorem looks like

(num_CASE n zc sc = v) <=>
(n = 0) ∧ (zc = v) ∨ ∃x. (n = SUC x) ∧ (sc x = v)

Such theorems can be powerful rewrites when (large) case-expressions
are asserted to be equal to some value or other.

These theorems have to be installed somewhat by hand for early types,
but from list onwards, the Datatype package handles this. This work
leverages earlier work done implementing prove_case_eq_thm (8f16922426).

Take the opportunity to rework TypeBasePure's code to use
FunctionalRecordUpdate.

This is progress with github issue #345.

Add some theorems from CakeML

pred_set: to do with bijections and surjections
list: MAP2 and LIST_REL results
pair: rewrites with (FST x = y) and (SND x = y) as LHSs

other changes are fixes for broken proofs.

Move pair, one, sum and option into one combined coretypes directory