According to the documentation of LatticeByCyclicExtension, the optional
second argument can be either a function, or a list of two functions.
The latter did not actually work, which is now fixed.

These are based on the assumption that computing the order
of a group element cannot be harder than computing the size
of the group, and in general is faster

This variant of Zuppos is currently undocumented, but used internally by
LatticeByCyclicExtension. This change speeds it as follows:

1. If Zuppos(G) is already known, it is faster to simply filter that list.
2. It replaces Group(c) by Subgroup(G,[c]), which makes things faster if
   G is a IsHandledByNiceMonomorphism group (such as an automorphism group).
3. In addition, it only creates this subgroup once (not twice as before),
   which can lead to further improvements.

Note that there are immediate methods which set IsTrivial suitably as
soon as the Size is known, hence these changes do not break any existing
use case. However, there are examples where computing Size is
infeasible, but computing IsTrivial is possible, sometimes even trivial.