Slightly simplify the sorting proof

Changes

1 changed files (+1/-3)

• Sort.lean
  • @@ -57,9 +57,7 @@ theorem sorted : ICan'tBelieveItCanSort A |>.Pairwise (· ≤ ·) := by
    simp grind · grind - case vc2.step.isFalse => - simp_all - grind + case vc2.step.isFalse => grind case vc3.step.pre => grind case vc4.step.post.success => simp_all