[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-divides-pot-01
⊦ prime(i) ∧ 0 < j → (i | i0 ^ j ↔ i | i0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
prime-divides-pot
,
Used by units in proved state:
int-mod
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
Used spec theorems:
int-pot
/
Pot-pos
Used simplifier rules:
int-gcd
/
divides-mult-01
int-mult
/
commutativity
int-mult
/
associativity
int-gcd
/
prime-divides
int-abs
/
sub-pred
int-abs
/
elim-sub
int-abs
/
forward-le-01
int-abs
/
mone-06
int-abs
/
numls-02
int-pot
/
Pot-zero
int-gcd
/
prime-divides-one
int-abs
/
forward-le-05
int-abs
/
lels-02
intnat
/
abs-succ-03
int-basic2
/
add-a
int-basic2
/
add-c
nat-basic2
/
s
intnat
/
labs
int-abs
/
abs-16
oelem
/intlista/
irreflexivity
nat-basic2
/
a
nat-basic2
/
c