Metamath Proof Explorer


Theorem nn0nndivcl

Description: Closure law for dividing of a nonnegative integer by a positive integer. (Contributed by Alexander van der Vekens, 14-Apr-2018)

Ref Expression
Assertion nn0nndivcl ⊢ K ∈ ℕ 0 ∧ L ∈ ℕ → K L ∈ ℝ

Proof

Step Hyp Ref Expression
1 elnnne0 ⊢ L ∈ ℕ ↔ L ∈ ℕ 0 ∧ L ≠ 0
2 nn0re ⊢ K ∈ ℕ 0 → K ∈ ℝ
3 2 adantr ⊢ K ∈ ℕ 0 ∧ L ∈ ℕ 0 ∧ L ≠ 0 → K ∈ ℝ
4 nn0re ⊢ L ∈ ℕ 0 → L ∈ ℝ
5 4 ad2antrl ⊢ K ∈ ℕ 0 ∧ L ∈ ℕ 0 ∧ L ≠ 0 → L ∈ ℝ
6 simprr ⊢ K ∈ ℕ 0 ∧ L ∈ ℕ 0 ∧ L ≠ 0 → L ≠ 0
7 3 5 6 3jca ⊢ K ∈ ℕ 0 ∧ L ∈ ℕ 0 ∧ L ≠ 0 → K ∈ ℝ ∧ L ∈ ℝ ∧ L ≠ 0
8 1 7 sylan2b ⊢ K ∈ ℕ 0 ∧ L ∈ ℕ → K ∈ ℝ ∧ L ∈ ℝ ∧ L ≠ 0
9 redivcl ⊢ K ∈ ℝ ∧ L ∈ ℝ ∧ L ≠ 0 → K L ∈ ℝ
10 8 9 syl ⊢ K ∈ ℕ 0 ∧ L ∈ ℕ → K L ∈ ℝ