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?-<i>-iff-match-conc theorem
described in deftreeops.
This is nil if the theorem is not generated.
The name of the <prefix>-<rulename>-conc<i> function
described in deftreeops.
This is nil if the function is not generated.
The name of the <prefix>-<rulename>-conc<i>-matching theorem
described in deftreeops.
This is nil if the theorem is not generated.
The information about the repetitions that form the concatenation.
