Theorem: LO.FirstOrder.Rew.q_eq_zero_iff (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₃ : ℕ
ω✝ ω : Rew L ξ₁ n₁ ξ₂ n₂
t : Semiterm L ξ₁ (n₁ + 1)
⊢ ω.q t = #0 ↔ t = #0
Tactic:
cases t <;> simp [Rew.func]
State after:
case bvar
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₃ : ℕ
ω✝ ω : Rew L ξ₁ n₁ ξ₂ n₂
a✝ : Fin (n₁ + 1)
⊢ ω.q #a✝ = #0 ↔ a✝ = 0

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₃ : ℕ
ω✝ ω : Rew L ξ₁ n₁ ξ₂ n₂
i : Fin (n₁ + 1)
⊢ ω.q #i = #0 ↔ i = 0
Tactic:
case bvar i =>
  cases i using Fin.cases <;> simp [Fin.succ_ne_zero]
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₃ : ℕ
ω✝ ω : Rew L ξ₁ n₁ ξ₂ n₂
i : Fin (n₁ + 1)
⊢ ω.q #i = #0 ↔ i = 0
Tactic:
cases i using Fin.cases <;> simp [Fin.succ_ne_zero]
State after:
no goals