The discriminant term used in
the <prefix>-<rulename>-conc-equivs theorem
described in deftreeops.
This is nil if the rule name is defined by
an alternation of just one concatenation.
The name of the <prefix>-<rulename>-conc-matching
or <prefix>-<rulename>-conc<i>-matching theorem
described in deftreeops.
This is nil if the theorem is not generated,
i.e. if the concatenation is not a singleton.
The name of the <prefix>-<rulename>-conc?-<i>-iff-match-conc theorem
described in deftreeops.
This is nil if the theorem is not generated,
i.e. if the rule name is defined by
an alternation of just one concatenation.
The name of the <prefix>-<rulename>-conc
or <prefix>-<rulename>-conc<i> function
described in deftreeops.
The information about the repetitions that form the concatenation.
This is nil if the concatenation is not a singleton,
because in that case the matching theorems for the repetitions
are not generated (see deftreeops-rep-info).