Theorem: Smt.Reconstruct.Int.sum_ub₉ (Smt/Reconstruct/Int/Lemmas.lean)

State before:
a b c d : Int
h₁ : a = b
h₂ : c = d
⊢ a + c ≤ b + d
Tactic:
rewrite [h₁, h₂]
State after:
a b c d : Int
h₁ : a = b
h₂ : c = d
⊢ b + d ≤ b + d

State before:
a b c d : Int
h₁ : a = b
h₂ : c = d
⊢ b + d ≤ b + d
Tactic:
exact Int.le_refl (b + d)
State after:
no goals