Database
ELEMENTARY NUMBER THEORY
Elementary prime number theory
Euler's theorem
dvdsfi
Next ⟩
hashgcdeq
Metamath Proof Explorer
Ascii
Unicode
Theorem
dvdsfi
Description:
A natural number has finitely many divisors.
(Contributed by
Jim Kingdon
, 9-Oct-2025)
Ref
Expression
Assertion
dvdsfi
⊢
N
∈
ℕ
→
x
∈
ℕ
|
x
∥
N
∈
Fin
Proof
Step
Hyp
Ref
Expression
1
fzfid
⊢
N
∈
ℕ
→
1
…
N
∈
Fin
2
dvdsssfz1
⊢
N
∈
ℕ
→
x
∈
ℕ
|
x
∥
N
⊆
1
…
N
3
1
2
ssfid
⊢
N
∈
ℕ
→
x
∈
ℕ
|
x
∥
N
∈
Fin