Theorem: nat_min_zero (Katydid/Std/Lists.lean)

State before:
n : ℕ
⊢ min 0 n = 0
Tactic:
unfold min
State after:
n : ℕ
⊢ instMinNat.1 0 n = 0

State before:
n : ℕ
⊢ instMinNat.1 0 n = 0
Tactic:
unfold instMinNat
State after:
n : ℕ
⊢ minOfLe.1 0 n = 0

State before:
n : ℕ
⊢ minOfLe.1 0 n = 0
Tactic:
unfold minOfLe
State after:
n : ℕ
⊢ { min := fun x y => if x ≤ y then x else y }.1 0 n = 0

State before:
n : ℕ
⊢ { min := fun x y => if x ≤ y then x else y }.1 0 n = 0
Tactic:
simp
State after:
no goals