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
|- ( ph -> A e. RR )
resubaddcld.2
|- ( ph -> B e. RR )
resubaddcld.3
|- ( ph -> C e. RR )
Assertion resubaddcld
|- ( ph -> ( ( A - B ) + C ) e. RR )

Proof

Step Hyp Ref Expression
1 resubaddcld.1
 |-  ( ph -> A e. RR )
2 resubaddcld.2
 |-  ( ph -> B e. RR )
3 resubaddcld.3
 |-  ( ph -> C e. RR )
4 1 2 resubcld
 |-  ( ph -> ( A - B ) e. RR )
5 4 3 readdcld
 |-  ( ph -> ( ( A - B ) + C ) e. RR )