Theorem: Nat.isLtNat_pos_iff (Logic/Vorspiel/Arith.lean)

State before:
n m : ℕ
⊢ 0 < n.isLtNat m ↔ n < m
Tactic:
simp[isLtNat]
State after:
n m : ℕ
⊢ (0 < if n < m then 1 else 0) ↔ n < m

State before:
n m : ℕ
⊢ (0 < if n < m then 1 else 0) ↔ n < m
Tactic:
by_cases n < m <;> simp[*]
State after:
no goals