Grid Walking $\#1$

Consider the folowing $10 \times 7$ grid ,

Joe wants to go from $(\, 0,0 )\,$ to $(\, 10,7 )\,$ . At any point he can only go one unit up or one unit right

Now Joe can go to $(\, 10,7 )\,$ in multiple ways. Each path from $(\, 0,0 )\,$ to $(\, 10,7 )\,$ is a set of points that have been covered by Joe ( in a particular order like shown below) For eg.

$(\, 0,0 )\,$ $(\, 0,1 )\,$ $(\, 0,2 )\,$ $(\, 0,3 )\,$ $(\, 0,4 )\,$ $(\, 0,5 )\,$ $(\, 0,6)\,$ $(\, 1,6 )\,$ $(\, 2,6 )\,$ $(\, 3,6 )\,$

$(\, 4,6 )\,$ $(\, 5,6 )\,$ $(\, 6,6 )\,$ $(\, 7,6 )\,$ $(\, 8,6 )\,$ $(\, 9,6 )\,$ $(\, 10,6 )\,$ $(\, 10,7 )\,$ is a path from $(\, 0,0 )\,$ to $(\, 10,7 )\,$

Now the rule is that no two points $(\, A,B )\,$ and $(\, C,D)\,$ in this set of points ( a path ) should satisfy these properties ( both ) $A=C$ and $B-D>1$

how many ways are there to go from $(\, 0,0 )\,$ to $(\, 10,7 )\,$ ?