Theorem: LO.FirstOrder.Structure.lt_lang (Logic/FirstOrder/Basic/Operator.lean)

State before:
L : Language
M : Type u_1
inst✝³ : Structure L M
inst✝² : L.LT
inst✝¹ : LT M
inst✝ : Structure.LT L M
v : Fin 2 → M
⊢ rel Language.LT.lt v ↔ v 0 < v 1
Tactic:
simpa[Semiformula.Operator.LT.sentence_eq, eval_rel, ←Matrix.fun_eq_vec₂] using
  Structure.LT.lt (L := L) (v 0) (v 1)
State after:
no goals