[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 product-positive
∀ i. i ∈ ints → 0 < i ⊦ ¬ Π ints ≤ 0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
int-fac
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
product-one
,
product-app
,
prod-empty
,
Used spec theorems:
int-mult
/
zero-le
Used simplifier rules:
list
/intlista/
in-17
list
/intlista/
in-append
list
/intlista/
a
list
/intlista/
c
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
zero-le-03
int-abs
/
lenls
int-abs
/
forward-le-05
int-abs
/
forward-le-04
int-abs
/
forward-lels
int-abs
/
lels
int-abs
/
zero-gels-04