REORDER_ANTS : (term list -> term list) -> thm -> thm
|- !x. a1 ==> !y. a2 ==> !z. a3 ==> !u. t ----------------------------------------- REORDER_ANTS rev |- a3 ==> a2 ==> a1 ==> t
But a choice of f other than reordering a list of terms will give a result with assumptions remaining or superfluous antecedents