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 ⊢ ( 𝜑 → 𝐴 ∈ ℝ )
resubaddcld.2 ⊢ ( 𝜑 → 𝐵 ∈ ℝ )
resubaddcld.3 ⊢ ( 𝜑 → 𝐶 ∈ ℝ )
Assertion resubaddcld ( 𝜑 → ( ( 𝐴 − 𝐵 ) + 𝐶 ) ∈ ℝ )

Proof

Step Hyp Ref Expression
1 resubaddcld.1 ⊢ ( 𝜑 → 𝐴 ∈ ℝ )
2 resubaddcld.2 ⊢ ( 𝜑 → 𝐵 ∈ ℝ )
3 resubaddcld.3 ⊢ ( 𝜑 → 𝐶 ∈ ℝ )
4 1 2 resubcld ⊢ ( 𝜑 → ( 𝐴 − 𝐵 ) ∈ ℝ )
5 4 3 readdcld ⊢ ( 𝜑 → ( ( 𝐴 − 𝐵 ) + 𝐶 ) ∈ ℝ )