A friend sets a puzzle: 'I am thinking of a number greater than 5, less than 10, and even.' You can hunt for it, and 6 and 8 both work, so the clues are consistent. Change the last clue to 'and greater than 12' and no search will ever succeed: the first two clues trap the number between 5 and 10, the new clue demands more than 12, and the three can never all be true. The set is inconsistent, even though each clue on its own is perfectly reasonable.
That last point is the one people miss. Consistency belongs to the whole set, not to each statement. The equations x+y=4 and x+y=6 each have infinitely many solutions, but together they demand that one sum be both 4 and 6, so the pair has none. To show a set is consistent, exhibit one example that satisfies everything. To show it is inconsistent, combine statements until a clash such as 4=6 appears.
Consistency is easy to mix up with completeness and with validity. Completeness asks whether every true statement can be proved, which is a different question. Validity asks whether a conclusion follows from premises; an argument can be valid even when its premises contradict each other, which is exactly why inconsistent premises are dangerous: they validly lead to any conclusion at all.
Think of it like this. A set of statements is like the rule sheet of a board game. If one rule says 'the youngest player moves first' and another says 'the oldest player moves first', the game cannot start, however sensible each rule looks alone. A mathematical contradiction is worse than a stalled game, though: it lets you prove any statement whatsoever.
Core idea. A set of statements is consistent if they can all be true at once — no contradiction can be derived from them.