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

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

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