information:filtering, structural:expansion
Second proof

We count the number of paths which start and end on the diagonal of an n × n grid. All such paths have n right and n up steps. Since we can choose which of the 2 n steps are up or right, there are in total (2 n n) {\displaystyle {\tbinom {2n}{n}}} monotonic paths of this type. A bad path crosses the main diagonal and touches the next higher diagonal (red in the illustration).

The part of the path after the higher diagonal is then flipped about that diagonal, as illustrated with the red dotted line. This swaps all the right steps to up steps and vice versa. In the section of the path that is not reflected, there is one more up step than right steps, so therefore the remaining section of the bad path has one more right step than up steps. When this portion of the path is reflected, it will have one more up step than right steps.

Since there are still 2 n steps, there are now n + 1 up steps and n − 1 right steps. So, instead of reaching (n, n), all bad paths after reflection end at (n − 1, n + 1). Because every monotonic path in the (n − 1) × (n + 1) grid meets the higher diagonal, and because the reflection process is reversible, the reflection is therefore a bijection between bad paths in the original grid and monotonic paths in the new grid.

The number of bad paths is therefore:

and the number of Catalan paths (i.e. good paths) is obtained by removing the number of bad paths from the total number of monotonic paths of the original grid,

In terms of Dyck words, we start with a (non-Dyck) sequence of n X's and n Y's and interchange all X's and Y's after the first Y that violates the Dyck condition. After this Y, note that there is exactly one more Y than there are Xs.