Theorem: Smt.Reconstruct.Arith.sumBounds₈ (Smt/Reconstruct/Arith/SumBounds/Lemmas.lean)

State before:
α : Type
inst✝ : LinearOrderedRing α
a b c d : α
⊢ a = b → c ≤ d → a + c ≤ b + d
Tactic:
intros h₁ h₂
State after:
α : Type
inst✝ : LinearOrderedRing α
a b c d : α
h₁ : a = b
h₂ : c ≤ d
⊢ a + c ≤ b + d

State before:
α : Type
inst✝ : LinearOrderedRing α
a b c d : α
h₁ : a = b
h₂ : c ≤ d
⊢ a + c ≤ b + d
Tactic:
rewrite [h₁]
State after:
α : Type
inst✝ : LinearOrderedRing α
a b c d : α
h₁ : a = b
h₂ : c ≤ d
⊢ b + c ≤ b + d

State before:
α : Type
inst✝ : LinearOrderedRing α
a b c d : α
h₁ : a = b
h₂ : c ≤ d
⊢ b + c ≤ b + d
Tactic:
exact add_le_add_left h₂ b
State after:
no goals