The sentence 'x+3>5' is neither true nor false until you know what x is. A quantifier settles that by saying how many values the claim covers. '∀x, x+3>5' (for every real x) is false: x=0 gives 3>5. '∃x, x+3>5' (for some real x) is true: x=10 works. Same sentence, different quantifier, opposite truth values.
The two quantifiers need opposite kinds of evidence. To prove a ∀ claim you must cover every case, usually with algebra rather than examples; to disprove it, one counterexample is enough. To prove an ∃ claim, one example is enough; to disprove it, you must show that every case fails. That is why negation swaps them: ¬∀xP(x) is ∃x¬P(x), and ¬∃xP(x) is ∀x¬P(x).
When two quantifiers appear, their order changes the meaning. '∀x∃y: y>x' says every number has some bigger number, which is true (take y=x+1). '∃y∀x: y>x' says one number is bigger than every number, itself included, which is false. Same symbols, swapped order, a different claim.
Think of it like this. A ∀ claim is like a teacher announcing 'everyone handed in the homework': one missing student makes it false. An ∃ claim is 'someone handed in the homework': one student who did makes it true. A single student settles each claim, but in opposite directions.
Core idea. Quantifiers set the scope of a predicate: every case (∀) or at least one case (∃).