Evidence that PPAD is hard?
PPAD is pretty "low" above P and not much would change in our understanding of complexity if it was shown equal to P (except that the few problems in PPAD would now be in P).  The main "evidence" that PPAD!=P is an oracle separation, which is essentially equivalent to the  combinatorial fact that no "black-box simulation" exists.