[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 ex-two
⊦ (∃ j. i = 2 * j) ∨ (∃ j. i = 2 * j + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
square-even
,
Used by units in proved state:
int-min
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
commutativity
,
associativity
,
one
,
numeq-03
,
Used spec theorems:
int-basic2
/
ex-oddeven
Used simplifier rules:
int-basic2
/
add-zero-rev
int-abs
/
numadd
int-basic2
/
eq
int-basic2
/
add-in
int-basic2
/
add-a
int-basic2
/
add-c