[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 zero-ge-case
⊦ 0 ≤ i * j ↔ i = 0 ∨ j = 0 ∨ 0 ≤ i ∧ 0 ≤ j ∨ i ≤ 0 ∧ j ≤ 0
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: 1
Proof steps: 2
Used lemmas:
commutativity
,
associativity
,
zero-ge-03
,
zero-ge
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-02
int-basic1
/
ls-01
int-abs
/
lels-01
int-basic1
/
lf-01
int-basic1
/
trans
int-abs
/
forward-le-02
int-basic1
/
lf-02
int-abs
/
forward-le-05
int-abs
/
lels
int-abs
/
zero-gels-01