internlm/Lean-Github huggingface dataset:
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inl.inl
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : True
⊢ False

case inr.inr.inl.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : if Order.lex a b then True else False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Tactic:
rename_i h₁ h₂ h₃
Proof state after:
case inr.inr.inl.inl
n : ℕ
a b c : Variables n order.GrLex
h✝ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h₁ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h₂ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h₃ : Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : True
⊢ False

case inr.inr.inl.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : if Order.lex a b then True else False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inl.inl
n : ℕ
a b c : Variables n order.GrLex
h✝ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h₁ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h₂ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h₃ : Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : True
⊢ False

case inr.inr.inl.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : if Order.lex a b then True else False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Tactic:
exact Nat.le_lt_antisymm h₁ h₃
Proof state after:
case inr.inr.inl.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : if Order.lex a b then True else False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inl.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : if Order.lex a b then True else False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Tactic:
simp at *
Proof state after:
case inr.inr.inl.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h_le : if Order.lex a b then True else False
h✝ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inl.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h_le : if Order.lex a b then True else False
h✝ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Tactic:
split at h_le
Proof state after:
case inr.inr.inl.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : Order.lex a b
h_le : True
⊢ False

case inr.inr.inl.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.lex a b
h_le : False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inl.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : Order.lex a b
h_le : True
⊢ False

case inr.inr.inl.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.lex a b
h_le : False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Tactic:
rename_i h_lex₁ _ _ _ h_lex₂
Proof state after:
case inr.inr.inl.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h_lex₁ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h_lex₂ : Order.lex a b
h_le : True
⊢ False

case inr.inr.inl.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.lex a b
h_le : False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inl.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h_lex₁ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h_lex₂ : Order.lex a b
h_le : True
⊢ False

case inr.inr.inl.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.lex a b
h_le : False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Tactic:
have hr := lex_add_le_add a b c h_lex₂
Proof state after:
case inr.inr.inl.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h_lex₁ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h_lex₂ : Order.lex a b
h_le : True
hr : Order.lex (Variables.mul a c) (Variables.mul b c)
⊢ False

case inr.inr.inl.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.lex a b
h_le : False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inl.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h_lex₁ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h_lex₂ : Order.lex a b
h_le : True
hr : Order.lex (Variables.mul a c) (Variables.mul b c)
⊢ False

case inr.inr.inl.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.lex a b
h_le : False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Tactic:
contradiction
Proof state after:
case inr.inr.inl.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.lex a b
h_le : False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inl.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝⁴ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝³ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝² : Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.lex a b
h_le : False
⊢ False

case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Tactic:
exact h_le
Proof state after:
case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  let sum₁ := Order.grlex.elem_sum a;
  let sum₂ := Order.grlex.elem_sum b;
  if sum₁ < sum₂ then True else if sum₁ = sum₂ then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : ¬sum₁ < sum₂
h✝ : ¬sum₁ = sum₂
⊢ False
Tactic:
simp [elem_sum_is_hom] at *
Proof state after:
case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  if Order.grlex.elem_sum a < Order.grlex.elem_sum b then True
  else if Order.grlex.elem_sum a = Order.grlex.elem_sum b then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h_le :
  if Order.grlex.elem_sum a < Order.grlex.elem_sum b then True
  else if Order.grlex.elem_sum a = Order.grlex.elem_sum b then if Order.lex a b then True else False else False
h✝² : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝¹ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
⊢ False
Tactic:
split at h_le
Proof state after:
case inr.inr.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : True
⊢ False

case inr.inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : False
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : True
⊢ False

case inr.inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : False
⊢ False
Tactic:
rename_i h₁ h₂ h₃
Proof state after:
case inr.inr.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h✝ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h₁ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h₂ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h₃ : Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : True
⊢ False

case inr.inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : False
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inr.inl
n : ℕ
a b c : Variables n order.GrLex
h✝ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h₁ : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h₂ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h₃ : Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : True
⊢ False

case inr.inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : False
⊢ False
Tactic:
exact Nat.le_lt_antisymm h₁ h₃
Proof state after:
case inr.inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : False
⊢ False
Theorem: algebra.grlex_add_le_add
Proof state before:
case inr.inr.inr.inr
n : ℕ
a b c : Variables n order.GrLex
h✝³ : ¬Order.lex (Variables.mul a c) (Variables.mul b c)
sum₁ : ℕ := Order.grlex.elem_sum (Variables.mul a c)
sum₂ : ℕ := Order.grlex.elem_sum (Variables.mul b c)
h✝² : Order.grlex.elem_sum b ≤ Order.grlex.elem_sum a
h✝¹ : ¬Order.grlex.elem_sum a = Order.grlex.elem_sum b
h✝ : ¬Order.grlex.elem_sum a < Order.grlex.elem_sum b
h_le : False
⊢ False
Tactic:
exact h_le
Proof state after:
no goals