Metamath Proof Explorer


Theorem remulsubcld

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

Ref Expression
Hypotheses remulsubcld.1
|- ( ph -> A e. RR )
remulsubcld.2
|- ( ph -> B e. RR )
remulsubcld.3
|- ( ph -> C e. RR )
Assertion remulsubcld
|- ( ph -> ( ( A x. B ) - C ) e. RR )

Proof

Step Hyp Ref Expression
1 remulsubcld.1
 |-  ( ph -> A e. RR )
2 remulsubcld.2
 |-  ( ph -> B e. RR )
3 remulsubcld.3
 |-  ( ph -> C e. RR )
4 1 2 remulcld
 |-  ( ph -> ( A x. B ) e. RR )
5 4 3 resubcld
 |-  ( ph -> ( ( A x. B ) - C ) e. RR )