[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 coprimes-min
⊦ 0 < i → min(coprimes(i)) = 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 24
Used lemmas:
count-i2j-min
,
filterFun-min
,
count-i2j-in
,
filterFun-in
,
min-empty
,
min-in
,
min-def
,
coprimes-def
,
Used spec theorems:
list
/intlista/
some-element
Used simplifier rules:
int-abs
/
forward-le-05
int-gcd
/
gcd-one-01
int-abs
/
lsone
int-abs
/
lels-02
list
/intlista/
in-empty
int-abs
/
forward-le-04
int-abs
/
forward-lele
int-abs
/
forward-lels
int-abs
/
leone
int-abs
/
lenls
int-abs
/
lels
int-abs
/
lels-03