Theorem: LO.FirstOrder.Semiterm.Positive.bvar (Logic/FirstOrder/Basic/Syntax/Term.lean)

State before:
L : Language
L' : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_1
ξ' : Type u_2
ξ₁ : Type u_3
ξ₂ : Type u_4
ξ₃ : Type u_5
n n₁ n₂ n₃ : ℕ
x : Fin (n + 1)
⊢ (#x).Positive ↔ 0 < x
Tactic:
simp[Positive]
State after:
no goals