Metamath Proof Explorer


Theorem resubaddcld

Description: Real closure of a sum whose first term is a difference, in deduction form. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

Ref Expression
Hypotheses resubaddcld.1 ⊢ φ → A ∈ ℝ
resubaddcld.2 ⊢ φ → B ∈ ℝ
resubaddcld.3 ⊢ φ → C ∈ ℝ
Assertion resubaddcld ⊢ φ → A - B + C ∈ ℝ

Proof

Step Hyp Ref Expression
1 resubaddcld.1 ⊢ φ → A ∈ ℝ
2 resubaddcld.2 ⊢ φ → B ∈ ℝ
3 resubaddcld.3 ⊢ φ → C ∈ ℝ
4 1 2 resubcld ⊢ φ → A − B ∈ ℝ
5 4 3 readdcld ⊢ φ → A - B + C ∈ ℝ