The name of the <prefix>-<rulename>-conc-rep-matching
or <prefix>-<rulename>-conc<i>-rep-matching theorem
described in deftreeops.
This is nil if the theorem is not generated,
i.e. if the repetition does not have range 1
or the concatenation of which the repetition is part
is not a singleton.
The name of the <prefix>-<rulename>-conc-rep
or <prefix>-<rulename>-conc<i>-rep function
described in deftreeops.
This is nil if the function is not generated,
i.e. if the concatenation of which this repetition is part
consists of two or more repetitions,
or if this repetition has a range that is not 1.
The name of the <prefix>-<rulename>-conc-rep-elem
or <prefix>-<rulename>-conc<i>-rep-elem function
describes in deftreeops.
This is nil if the function is not generated,
i.e. if the concatanation of which this repetition is part
consists of two or more repetitions,
or if the single repetition does not have a range of 1,
or if the repetition element is not a rule name.