Theorem: LO.FirstOrder.Semiterm.fvarList_emb (Logic/FirstOrder/Basic/Syntax/Rew.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₃ : ℕ
o : Type u_6
e : IsEmpty o
t : Semiterm L o n
⊢ (Rew.emb t).fvarList = []
Tactic:
induction t <;> simp[*, List.eq_nil_iff_forall_not_mem, Rew.func]
State after:
case fvar
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₃ : ℕ
o : Type u_6
e : IsEmpty o
a✝ : o
⊢ ∀ (a : ξ), a ∉ (Rew.emb &a✝).fvarList

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₃ : ℕ
o : Type u_6
e : IsEmpty o
x : o
⊢ ∀ (a : ξ), a ∉ (Rew.emb &x).fvarList
Tactic:
case fvar x => exact IsEmpty.elim' e x
State after:
no goals

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₃ : ℕ
o : Type u_6
e : IsEmpty o
x : o
⊢ ∀ (a : ξ), a ∉ (Rew.emb &x).fvarList
Tactic:
exact IsEmpty.elim' e x
State after:
no goals