have : m ≃ n ∨ m > n := Or.inl (Rel.symm ‹n ≃ m›)
ℕ : Type
inst✝³ : Core ℕ
inst✝² : Induction ℕ
inst✝¹ : Addition ℕ
inst✝ : Sign ℕ
order_inst : Order ℕ
n m : ℕ
x✝ : step m > n
this : n < m ∨ n ≃ m
h✝ : n ≃ m
⊢ m ≃ n ∨ m > n
ℕ : Type
inst✝³ : Core ℕ
inst✝² : Induction ℕ
inst✝¹ : Addition ℕ
inst✝ : Sign ℕ
order_inst : Order ℕ
n m : ℕ
x✝ : step m > n
this✝ : n < m ∨ n ≃ m
h✝ : n ≃ m
this : m ≃ n ∨ m > n
⊢ m ≃ n ∨ m > n