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

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

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