[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 modzero-07
⊦ j0 + j < 0 ∧ j < 0 ∧ 0 < i → ¬ 0 ≤ i * j + j0
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
int-div
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 5
Used lemmas:
zero-ls
,
commutativity
,
associativity
,
Mult-zero
,
minus-left
,
modlep
,
Used spec theorems:
int-abs
/
zero-ge-01
Used simplifier rules:
int-abs
/
lels-03
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
zero-01
int-abs
/
le-def
int-abs
/
neg-07
int-abs
/
negle-13
int-basic2
/
add-zero