[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
⊦ 0 < j → (i ^ j = 0 ↔ i = 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
div-div-rec
,
mod-add1-negneg
,
mod-add1-pospos
,
mod-lsz
,
notneg-01
,
pot-sub-dist
,
zero-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
Pot-zero
,
Pot-pos
,
zero-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-basic1
/
elim-pred
int-abs
/
forward-le-01
int-abs
/
mone-06
int-abs
/
numls-02
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
zero-eq
int-abs
/
lels
int-abs
/
anti
int-basic2
/
succ-01
intnat
/
rax-04
int-basic2
/
add-a
int-basic2
/
add-c
nat-basic2
/
s
intnat
/
labs
int-abs
/
absle
int-basic1
/
irref
nat-basic2
/
a
nat-basic2
/
c