I combinator ($I\equiv \lambda x.x$)

The identity function represented as a closed lambda term. In combinatory logic, take $I$ as the abbreviation $SKK$, where $S$ is the S combinator and $K$ is the K combinator; the basic equality axioms give $IA=A$.