Metamath Proof Explorer


Theorem readdmulcld

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

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

Proof

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