e/Combinatorial proof

Information
has gloss	eng: In mathematics, the term combinatorial proof is often used to mean either of two types of proof of an identity in enumerative combinatorics that states that two sets of combinatorial configurations, depending on one or more parameters, have the same number of elements (for all values of the parameters):
lexicalization	eng: combinatorial proof
instance of	(noun) a formal series of statements showing that if one thing is true something else necessarily follows from it proof