[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 pot-lez
⊦ 0 < i → (i ^ j ≤ 0 ↔ i ^ j = 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
pot-nls
,
two-lez-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
eqone-02
,
zero-02
,
Pot-neg
,
pot-zero-01
,
notneg-02
,
Used spec theorems:
Used simplifier rules:
int-basic1
/
lf-02
int-basic2
/
succ-01
int-abs
/
abs-16
int-abs
/
forward-le-02
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-div
/
one-pos
int-abs
/
lels-01
int-abs
/
abs-08
int-abs
/
lels-02