[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem prime-fac-divides
⊦ prime(i) ∧ i < j ∧ 0 < j → i | fac(j)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
prime-divides-coef
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
fac-zero
,
prime-fac-divides-01
,
fac-rec
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-mult
/
commutativity
int-mult
/
associativity
int-gcd
/
prime-divides
intnat
/
abs-pred
int-abs
/
lels-03
int-abs
/
sub-ls-01
int-abs
/
lels
int-abs
/
bet
int-abs
/
sub-eq-01
int-gcd
/
div-one-one
int-abs
/
lsone
int-gcd
/
prime-not-neg-01
int-abs
/
les
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
succ-02
int-abs
/
ler
int-abs
/
numls-02
int-abs
/
mone-06
int-abs
/
numsub
int-basic2
/
add-zero