Theorem: b₁_of_round_eq (Fl.lean)

State before:
round : ℕ → ℕ
n a b : ℕ
round_eq : round (a - b) = a - b
⊢ trunc n (a - b - round (a - b)) = a - b - round (a - b) ∧ trunc n (round (a - b) - (a - b)) = round (a - b) - (a - b)
Tactic:
rewrite [round_eq, tsub_self, trunc_zero]
State after:
round : ℕ → ℕ
n a b : ℕ
round_eq : round (a - b) = a - b
⊢ 0 = 0 ∧ 0 = 0

State before:
round : ℕ → ℕ
n a b : ℕ
round_eq : round (a - b) = a - b
⊢ 0 = 0 ∧ 0 = 0
Tactic:
exact ⟨rfl, rfl⟩
State after:
no goals