[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 even-add
⊦ (i + j) % 2 = 0 ↔ i % 2 = 0 ∧ j % 2 = 0 ∨ i % 2 ≠ 0 ∧ j % 2 ≠ 0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
int-square
,
int-min
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 34
Used lemmas:
even-not-ex
,
mod-two-02
,
modex
,
Used spec theorems:
int-mult
/
dist-lsplit
Used simplifier rules:
int-abs
/
elim-sub
int-mult
/
eq-dist
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c