Time for a proof by induction: Base case: if you use only one wipe and it looks clean, you won't trust it and you'll use a second one. Now assume that you need n+1 wipes to realize you needed n wipes.

If you needed n+1 wipes, by the inductive hypothesis you will take (n+1)+1=n+2 wipes which proves the hypothesis

Q.E.D.