Theorem: Pos.succ_le_succ (Extra/Pos/Lemmas.lean)

State before:
x y : Pos
⊢ x ≤ y → x + 1 ≤ y + 1
Tactic:
by_toNat
State after:
x y : Pos
⊢ y.toNat ≥ x.toNat → y.toNat + 1 ≥ x.toNat + 1

State before:
x y : Pos
⊢ y.toNat ≥ x.toNat → y.toNat + 1 ≥ x.toNat + 1
Tactic:
exact Nat.succ_le_succ
State after:
no goals