Fix identation for nested pattern matching / recursion

[pedrotst]

[pedrotst]

As an example, consider the translation of eqb

eqb : Π n : nat . Π m : nat . bool = λ n : nat . λ m : nat . μ eqb. n @(λ n : nat . Π m : nat . bool) {
  | O ➔ λ m : nat . μ' m @(λ m' : nat . bool) {
  | O ➔ true
  | S n' ➔ false
 }
  | S n' ➔ λ m : nat . μ' m @(λ m' : nat . bool) {
  | O ➔ false
  | S m' ➔ eqb n' m'
 }
 } m.

this is hideous