Transformation induction sur l'ordre lexicographique suivant la définition des types : les labels d'utilisateur pris en compte

the original file is properly saved and restored upon completion
(whatever the result is)

First working prototype of induction tactic working with lexicographic orders according to type definition

Alt-Ergo still fails at proving the following goal about distributivity though.

theory Test
  use import bool.Bool
  goal G: forall x y z:bool. andb (orb x y) z = orb (andb x z) (andb y z)
end