Theorem: Nat.Linear.Poly.denote_eq_cancelAux
File: src/lean/Init/Data/Nat/Linear.lean

tactic: assumption
state_before: case zero
ctx : Context
m₁ m₂ r₁ r₂ : Poly
h : denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂)
⊢ denote_eq ctx (cancelAux zero m₁ m₂ r₁ r₂)

tactic: simp
state_before: case succ
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
m₁ m₂ r₁ r₂ : Poly
h : denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂)
⊢ denote_eq ctx (cancelAux (succ fuel) m₁ m₂ r₁ r₂)

tactic: split <;> simp at h <;> try assumption
state_before: case succ
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
m₁ m₂ r₁ r₂ : Poly
h : denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂)
⊢ denote_eq ctx
    (match m₁, m₂ with
    | m₁, [] => (List.reverse r₁ ++ m₁, List.reverse r₂)
    | [], m₂ => (List.reverse r₁, List.reverse r₂ ++ m₂)
    | (k₁, v₁) :: m₁, (k₂, v₂) :: m₂ =>
      bif blt v₁ v₂ then cancelAux fuel m₁ ((k₂, v₂) :: m₂) ((k₁, v₁) :: r₁) r₂
      else
        bif blt v₂ v₁ then cancelAux fuel ((k₁, v₁) :: m₁) m₂ r₁ ((k₂, v₂) :: r₂)
        else
          bif blt k₁ k₂ then cancelAux fuel m₁ m₂ r₁ ((k₂ - k₁, v₁) :: r₂)
          else bif blt k₂ k₁ then cancelAux fuel m₁ m₂ ((k₁ - k₂, v₁) :: r₁) r₂ else cancelAux fuel m₁ m₂ r₁ r₂)

tactic: rename_i k₁ v₁ m₁ k₂ v₂ m₂
state_before: case succ.h_3
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝¹ m₂✝¹ : Poly
k₁✝ : Nat
v₁✝ : Var
m₁✝ : List (Nat × Var)
k₂✝ : Nat
v₂✝ : Var
m₂✝ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁✝, v₁✝) :: m₁✝, List.reverse r₂ ++ (k₂✝, v₂✝) :: m₂✝)
⊢ denote_eq ctx
    (bif blt v₁✝ v₂✝ then cancelAux fuel m₁✝ ((k₂✝, v₂✝) :: m₂✝) ((k₁✝, v₁✝) :: r₁) r₂
    else
      bif blt v₂✝ v₁✝ then cancelAux fuel ((k₁✝, v₁✝) :: m₁✝) m₂✝ r₁ ((k₂✝, v₂✝) :: r₂)
      else
        bif blt k₁✝ k₂✝ then cancelAux fuel m₁✝ m₂✝ r₁ ((k₂✝ - k₁✝, v₁✝) :: r₂)
        else bif blt k₂✝ k₁✝ then cancelAux fuel m₁✝ m₂✝ ((k₁✝ - k₂✝, v₁✝) :: r₁) r₂ else cancelAux fuel m₁✝ m₂✝ r₁ r₂)

tactic: by_cases hltv : Nat.blt v₁ v₂ <;> simp [hltv]
state_before: case succ.h_3
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₂) :: m₂)
⊢ denote_eq ctx
    (bif blt v₁ v₂ then cancelAux fuel m₁ ((k₂, v₂) :: m₂) ((k₁, v₁) :: r₁) r₂
    else
      bif blt v₂ v₁ then cancelAux fuel ((k₁, v₁) :: m₁) m₂ r₁ ((k₂, v₂) :: r₂)
      else
        bif blt k₁ k₂ then cancelAux fuel m₁ m₂ r₁ ((k₂ - k₁, v₁) :: r₂)
        else bif blt k₂ k₁ then cancelAux fuel m₁ m₂ ((k₁ - k₂, v₁) :: r₁) r₂ else cancelAux fuel m₁ m₂ r₁ r₂)

tactic: assumption
state_before: case succ.h_3
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝¹ m₂✝¹ : Poly
k₁✝ : Nat
v₁✝ : Var
m₁✝ : List (Nat × Var)
k₂✝ : Nat
v₂✝ : Var
m₂✝ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁✝, v₁✝) :: m₁✝, List.reverse r₂ ++ (k₂✝, v₂✝) :: m₂✝)
⊢ denote_eq ctx
    (bif blt v₁✝ v₂✝ then cancelAux fuel m₁✝ ((k₂✝, v₂✝) :: m₂✝) ((k₁✝, v₁✝) :: r₁) r₂
    else
      bif blt v₂✝ v₁✝ then cancelAux fuel ((k₁✝, v₁✝) :: m₁✝) m₂✝ r₁ ((k₂✝, v₂✝) :: r₂)
      else
        bif blt k₁✝ k₂✝ then cancelAux fuel m₁✝ m₂✝ r₁ ((k₂✝ - k₁✝, v₁✝) :: r₂)
        else bif blt k₂✝ k₁✝ then cancelAux fuel m₁✝ m₂✝ ((k₁✝ - k₂✝, v₁✝) :: r₁) r₂ else cancelAux fuel m₁✝ m₂✝ r₁ r₂)

tactic: apply ih
state_before: case succ.h_3.inl
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₂) :: m₂)
hltv : blt v₁ v₂ = true
⊢ denote_eq ctx (cancelAux fuel m₁ ((k₂, v₂) :: m₂) ((k₁, v₁) :: r₁) r₂)

tactic: simp [denote_eq] at h |-
state_before: case succ.h_3.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₂) :: m₂)
hltv : blt v₁ v₂ = true
⊢ denote_eq ctx (List.reverse ((k₁, v₁) :: r₁) ++ m₁, List.reverse r₂ ++ (k₂, v₂) :: m₂)

tactic: assumption
state_before: case succ.h_3.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
hltv : blt v₁ v₂ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₂)
⊢ denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₂)

tactic: by_cases hgtv : Nat.blt v₂ v₁ <;> simp [hgtv]
state_before: case succ.h_3.inr
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₂) :: m₂)
hltv : ¬blt v₁ v₂ = true
⊢ denote_eq ctx
    (bif blt v₂ v₁ then cancelAux fuel ((k₁, v₁) :: m₁) m₂ r₁ ((k₂, v₂) :: r₂)
    else
      bif blt k₁ k₂ then cancelAux fuel m₁ m₂ r₁ ((k₂ - k₁, v₁) :: r₂)
      else bif blt k₂ k₁ then cancelAux fuel m₁ m₂ ((k₁ - k₂, v₁) :: r₁) r₂ else cancelAux fuel m₁ m₂ r₁ r₂)

tactic: apply ih
state_before: case succ.h_3.inr.inl
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₂) :: m₂)
hltv : ¬blt v₁ v₂ = true
hgtv : blt v₂ v₁ = true
⊢ denote_eq ctx (cancelAux fuel ((k₁, v₁) :: m₁) m₂ r₁ ((k₂, v₂) :: r₂))

tactic: simp [denote_eq] at h |-
state_before: case succ.h_3.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₂) :: m₂)
hltv : ¬blt v₁ v₂ = true
hgtv : blt v₂ v₁ = true
⊢ denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse ((k₂, v₂) :: r₂) ++ m₂)

tactic: assumption
state_before: case succ.h_3.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
hltv : ¬blt v₁ v₂ = true
hgtv : blt v₂ v₁ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₂)
⊢ denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₂)

tactic: have heqv : v₁ = v₂ := eq_of_not_blt_eq_true hltv hgtv
state_before: case succ.h_3.inr.inr
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₂) :: m₂)
hltv : ¬blt v₁ v₂ = true
hgtv : ¬blt v₂ v₁ = true
⊢ denote_eq ctx
    (bif blt k₁ k₂ then cancelAux fuel m₁ m₂ r₁ ((k₂ - k₁, v₁) :: r₂)
    else bif blt k₂ k₁ then cancelAux fuel m₁ m₂ ((k₁ - k₂, v₁) :: r₁) r₂ else cancelAux fuel m₁ m₂ r₁ r₂)

tactic: subst heqv
state_before: case succ.h_3.inr.inr
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
v₂ : Var
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₂) :: m₂)
hltv : ¬blt v₁ v₂ = true
hgtv : ¬blt v₂ v₁ = true
heqv : v₁ = v₂
⊢ denote_eq ctx
    (bif blt k₁ k₂ then cancelAux fuel m₁ m₂ r₁ ((k₂ - k₁, v₁) :: r₂)
    else bif blt k₂ k₁ then cancelAux fuel m₁ m₂ ((k₁ - k₂, v₁) :: r₁) r₂ else cancelAux fuel m₁ m₂ r₁ r₂)

tactic: by_cases hltk : Nat.blt k₁ k₂ <;> simp [hltk]
state_before: case succ.h_3.inr.inr
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₁) :: m₂)
hltv hgtv : ¬blt v₁ v₁ = true
⊢ denote_eq ctx
    (bif blt k₁ k₂ then cancelAux fuel m₁ m₂ r₁ ((k₂ - k₁, v₁) :: r₂)
    else bif blt k₂ k₁ then cancelAux fuel m₁ m₂ ((k₁ - k₂, v₁) :: r₁) r₂ else cancelAux fuel m₁ m₂ r₁ r₂)

tactic: apply ih
state_before: case succ.h_3.inr.inr.inl
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₁) :: m₂)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : blt k₁ k₂ = true
⊢ denote_eq ctx (cancelAux fuel m₁ m₂ r₁ ((k₂ - k₁, v₁) :: r₂))

tactic: simp [denote_eq] at h |-
state_before: case succ.h_3.inr.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₁) :: m₂)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : blt k₁ k₂ = true
⊢ denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse ((k₂ - k₁, v₁) :: r₂) ++ m₂)

tactic: have haux : k₁ * Var.denote ctx v₁ ≤ k₂ * Var.denote ctx v₁ := Nat.mul_le_mul_right _ (Nat.le_of_lt (Nat.blt_eq.mp hltk))
state_before: case succ.h_3.inr.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : blt k₁ k₂ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₁)
⊢ denote ctx r₁ + denote ctx m₁ = denote ctx r₂ + (denote ctx m₂ + (k₂ - k₁) * Var.denote ctx v₁)

tactic: rw [Nat.mul_sub_right_distrib, ← Nat.add_assoc, ← Nat.add_sub_assoc haux]
state_before: case succ.h_3.inr.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : blt k₁ k₂ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₁)
haux : k₁ * Var.denote ctx v₁ ≤ k₂ * Var.denote ctx v₁
⊢ denote ctx r₁ + denote ctx m₁ = denote ctx r₂ + (denote ctx m₂ + (k₂ - k₁) * Var.denote ctx v₁)

tactic: apply Eq.symm
state_before: case succ.h_3.inr.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : blt k₁ k₂ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₁)
haux : k₁ * Var.denote ctx v₁ ≤ k₂ * Var.denote ctx v₁
⊢ denote ctx r₁ + denote ctx m₁ = denote ctx r₂ + denote ctx m₂ + k₂ * Var.denote ctx v₁ - k₁ * Var.denote ctx v₁

tactic: apply Nat.sub_eq_of_eq_add
state_before: case succ.h_3.inr.inr.inl.h.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : blt k₁ k₂ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₁)
haux : k₁ * Var.denote ctx v₁ ≤ k₂ * Var.denote ctx v₁
⊢ denote ctx r₂ + denote ctx m₂ + k₂ * Var.denote ctx v₁ - k₁ * Var.denote ctx v₁ = denote ctx r₁ + denote ctx m₁

tactic: simp [h]
state_before: case succ.h_3.inr.inr.inl.h.h.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : blt k₁ k₂ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₁)
haux : k₁ * Var.denote ctx v₁ ≤ k₂ * Var.denote ctx v₁
⊢ denote ctx r₂ + denote ctx m₂ + k₂ * Var.denote ctx v₁ = denote ctx r₁ + denote ctx m₁ + k₁ * Var.denote ctx v₁

tactic: by_cases hgtk : Nat.blt k₂ k₁ <;> simp [hgtk]
state_before: case succ.h_3.inr.inr.inr
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₁) :: m₂)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : ¬blt k₁ k₂ = true
⊢ denote_eq ctx (bif blt k₂ k₁ then cancelAux fuel m₁ m₂ ((k₁ - k₂, v₁) :: r₁) r₂ else cancelAux fuel m₁ m₂ r₁ r₂)

tactic: apply ih
state_before: case succ.h_3.inr.inr.inr.inl
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₁) :: m₂)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : ¬blt k₁ k₂ = true
hgtk : blt k₂ k₁ = true
⊢ denote_eq ctx (cancelAux fuel m₁ m₂ ((k₁ - k₂, v₁) :: r₁) r₂)

tactic: simp [denote_eq] at h |-
state_before: case succ.h_3.inr.inr.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₁) :: m₂)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : ¬blt k₁ k₂ = true
hgtk : blt k₂ k₁ = true
⊢ denote_eq ctx (List.reverse ((k₁ - k₂, v₁) :: r₁) ++ m₁, List.reverse r₂ ++ m₂)

tactic: have haux : k₂ * Var.denote ctx v₁ ≤ k₁ * Var.denote ctx v₁ := Nat.mul_le_mul_right _ (Nat.le_of_lt (Nat.blt_eq.mp hgtk))
state_before: case succ.h_3.inr.inr.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : ¬blt k₁ k₂ = true
hgtk : blt k₂ k₁ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₁)
⊢ denote ctx r₁ + (denote ctx m₁ + (k₁ - k₂) * Var.denote ctx v₁) = denote ctx r₂ + denote ctx m₂

tactic: rw [Nat.mul_sub_right_distrib, ← Nat.add_assoc, ← Nat.add_sub_assoc haux]
state_before: case succ.h_3.inr.inr.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : ¬blt k₁ k₂ = true
hgtk : blt k₂ k₁ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₁)
haux : k₂ * Var.denote ctx v₁ ≤ k₁ * Var.denote ctx v₁
⊢ denote ctx r₁ + (denote ctx m₁ + (k₁ - k₂) * Var.denote ctx v₁) = denote ctx r₂ + denote ctx m₂

tactic: apply Nat.sub_eq_of_eq_add
state_before: case succ.h_3.inr.inr.inr.inl.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : ¬blt k₁ k₂ = true
hgtk : blt k₂ k₁ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₁)
haux : k₂ * Var.denote ctx v₁ ≤ k₁ * Var.denote ctx v₁
⊢ denote ctx r₁ + denote ctx m₁ + k₁ * Var.denote ctx v₁ - k₂ * Var.denote ctx v₁ = denote ctx r₂ + denote ctx m₂

tactic: simp [h]
state_before: case succ.h_3.inr.inr.inr.inl.h.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : ¬blt k₁ k₂ = true
hgtk : blt k₂ k₁ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₂ * Var.denote ctx v₁)
haux : k₂ * Var.denote ctx v₁ ≤ k₁ * Var.denote ctx v₁
⊢ denote ctx r₁ + denote ctx m₁ + k₁ * Var.denote ctx v₁ = denote ctx r₂ + denote ctx m₂ + k₂ * Var.denote ctx v₁

tactic: have heqk : k₁ = k₂ := eq_of_not_blt_eq_true hltk hgtk
state_before: case succ.h_3.inr.inr.inr.inr
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₁) :: m₂)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : ¬blt k₁ k₂ = true
hgtk : ¬blt k₂ k₁ = true
⊢ denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)

tactic: subst heqk
state_before: case succ.h_3.inr.inr.inr.inr
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ : List (Nat × Var)
k₂ : Nat
m₂ : List (Nat × Var)
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₂, v₁) :: m₂)
hltv hgtv : ¬blt v₁ v₁ = true
hltk : ¬blt k₁ k₂ = true
hgtk : ¬blt k₂ k₁ = true
heqk : k₁ = k₂
⊢ denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)

tactic: apply ih
state_before: case succ.h_3.inr.inr.inr.inr
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₁, v₁) :: m₂)
hltk hgtk : ¬blt k₁ k₁ = true
⊢ denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)

tactic: simp [denote_eq] at h |-
state_before: case succ.h_3.inr.inr.inr.inr.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
h : denote_eq ctx (List.reverse r₁ ++ (k₁, v₁) :: m₁, List.reverse r₂ ++ (k₁, v₁) :: m₂)
hltk hgtk : ¬blt k₁ k₁ = true
⊢ denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂)

tactic: rw [← Nat.add_assoc, ← Nat.add_assoc] at h
state_before: case succ.h_3.inr.inr.inr.inr.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk hgtk : ¬blt k₁ k₁ = true
h : denote ctx r₁ + (denote ctx m₁ + k₁ * Var.denote ctx v₁) = denote ctx r₂ + (denote ctx m₂ + k₁ * Var.denote ctx v₁)
⊢ denote ctx r₁ + denote ctx m₁ = denote ctx r₂ + denote ctx m₂

tactic: exact Nat.add_right_cancel h
state_before: case succ.h_3.inr.inr.inr.inr.h
ctx : Context
fuel : Nat
ih :
  ∀ (m₁ m₂ r₁ r₂ : Poly),
    denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂) → denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)
r₁ r₂ m₁✝ m₂✝ : Poly
k₁ : Nat
v₁ : Var
m₁ m₂ : List (Nat × Var)
hltv hgtv : ¬blt v₁ v₁ = true
hltk hgtk : ¬blt k₁ k₁ = true
h : denote ctx r₁ + denote ctx m₁ + k₁ * Var.denote ctx v₁ = denote ctx r₂ + denote ctx m₂ + k₁ * Var.denote ctx v₁
⊢ denote ctx r₁ + denote ctx m₁ = denote ctx r₂ + denote ctx m₂