(12steps total)
PrintForm
Definitions
Lemmas
FTA
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
prime
factorization
includes
prime
divisors
1
1.
a
:
2.
b
:
3.
f
: {
a
..
b
}
4.
p
:
5. is_prime_factorization(
a
;
b
;
f
)
6. prime(
p
)
7.
p
| (
i
:{
a
..
b
}.
i
f
(
i
))
p
{
a
..
b
} & 0<
f
(
p
)
By:
FwdThru:
Thm*
p
:
.
Thm*
prime(
p
)
Thm*
Thm*
(
a
,
b
:
,
e
:({
a
..
b
}
).
Thm* (
a
<
b
p
| (
i
:{
a
..
b
}.
e
(
i
))
(
i
:{
a
..
b
}.
p
|
e
(
i
)))
on [ Hyp:-1 ]
Generated subgoals:
1
a
<
b
3
steps
2
8.
i
:{
a
..
b
}.
p
|
i
f
(
i
)
p
{
a
..
b
} & 0<
f
(
p
)
7
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(12steps total)
PrintForm
Definitions
Lemmas
FTA
Sections
DiscrMathExt
Doc