Look at a pattern: 3+5=8, 7+9=16, 11+1=12. Each time, two odd numbers add to an even number. To say this once for every odd number, write the two numbers as 2m+1 and 2n+1, where m and n stand for any whole numbers. Their sum is 2m+2n+2=2(m+n+1), twice a whole number, so it is even. The letters don't hide one value; they let a single argument run for every pair at once.
That changes what counts as evidence. Checking examples supports a general claim but never proves it, because infinitely many cases remain unchecked. One counterexample destroys it, though. The claim (a+b)2=a2+b2 works for a=0, b=5, but a=1, b=2 gives 9 on the left and 5 on the right, so the claim is false.
Compare 2(x+3)=2x+6 with 2x+3=11. Both contain an x, but the first holds for every x, since expanding the left side makes the two sides identical, while the second holds only for x=4. The first uses x as a generalization; the second uses it as a placeholder. Substituting a couple of values is a quick first test: if one fails, the statement is not true for all values. If they all pass, you still need algebra showing the two sides are the same expression.
Think of it like this. A general statement with letters is a promise in a store policy: 'any customer who returns an item within 30 days gets a refund.' You can't confirm it by checking customers one by one, but a single refused customer proves the promise broken. Unlike store policies, a mathematical 'for all' allows no exceptions whatsoever.
Core idea. A variable-as-generalization stands for any member of a set, letting one statement speak for all of them.