[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 exeven
i % 2 = 0 ⊦ ∃ j. i = 2 * j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
mod-twoeven
,
two-odd
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
nummult-le-01
,
div-elim2
,
mod-ls-same-02
,
div-elim-pos
,
Used spec theorems:
Used simplifier rules:
int-mult
/
zero-ge
int-abs
/
zero-gels-03
int-abs
/
forward-le-04
int-abs
/
numle-03
int-abs
/
negle-07
int-abs
/
abs-08
int-abs
/
forward-le-02
int-basic1
/
lf-02
int-abs
/
lels-01
int-basic2
/
add-zero-rev
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
mone-05
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
zero-ls
int-abs
/
zero-gels-01
int-mult
/
eq-pos