[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 div2-mult4-add-k
⊦ ((* n0) + 4 * n) / 2 = n0 / 2 + 2 * n
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
prepost-bubble-down
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
Used spec theorems:
nat-div
/
modex
nat-div
/
div-add
Used simplifier rules:
nat-mult
/
zero-02
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
rsucc-02
nat-basic
/
succ
nat-basic
/
eq-01
nat-basic
/
a
nat-basic
/
c