Theorem: LO.FirstOrder.Semiterm.lMap_positive (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₃ : ℕ
inst✝ : DecidableEq ξ
Φ : L₁ →ᵥ L₂
t : Semiterm L₁ ξ (n + 1)
⊢ (lMap Φ t).Positive ↔ t.Positive
Tactic:
induction t <;> simp [lMap_func, *]
State after:
no goals