Does an infinitely long tape make any difference when proving theorems about Turing Machines?
Yes it makes a huge difference!  A Turing machine with a finite tape is just a finite automaton, which we know are much less powerful.  For example, a TM with a finite tape cannot compute a context free grammar.  All of this is in theory, of course.