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

Proof

Step Hyp Ref Expression
1 remulsubcld.1 ⊢ ( 𝜑 → 𝐴 ∈ ℝ )
2 remulsubcld.2 ⊢ ( 𝜑 → 𝐵 ∈ ℝ )
3 remulsubcld.3 ⊢ ( 𝜑 → 𝐶 ∈ ℝ )
4 1 2 remulcld ⊢ ( 𝜑 → ( 𝐴 · 𝐵 ) ∈ ℝ )
5 4 3 resubcld ⊢ ( 𝜑 → ( ( 𝐴 · 𝐵 ) − 𝐶 ) ∈ ℝ )