The logical principle, upon which proof by contradiction is based. Let p and q be statements. If p implies not q, then q being true implies that p cannot be. For example, since all squares are rectangles, a shape which is not a rectangle cannot be a square. Here p is the statement ‘is a square’ and q is the statement ‘is not a rectangle’.