Metamath Proof Explorer


Theorem redivcl

Description: Closure law for division of reals. (Contributed by NM, 27-Sep-1999) (Revised by Mario Carneiro, 27-May-2016)

Ref Expression
Assertion redivcl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → A B ∈ ℝ

Proof

Step Hyp Ref Expression
1 simp1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → A ∈ ℝ
2 1 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → A ∈ ℂ
3 simp2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → B ∈ ℝ
4 3 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → B ∈ ℂ
5 simp3 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → B ≠ 0
6 divrec ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 0 → A B = A ⁢ 1 B
7 2 4 5 6 syl3anc ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → A B = A ⁢ 1 B
8 rereccl ⊢ B ∈ ℝ ∧ B ≠ 0 → 1 B ∈ ℝ
9 8 3adant1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → 1 B ∈ ℝ
10 1 9 remulcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → A ⁢ 1 B ∈ ℝ
11 7 10 eqeltrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 0 → A B ∈ ℝ