[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-03
⊦ i ≤ 0 → (0 ≤ i * j ↔ ¬ ¬(i = 0 ∨ j ≤ 0))
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
Comment:
Used by:
zero-ge-add
,
zero-ge-case
,
Used by units in proved state:
int-gcd
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
zero-ls-03
,
commutativity
,
associativity
,
zero-ge-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-04
int-abs
/
lels-01
int-abs
/
lels-02
int-abs
/
lels-03