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