[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
,
Proof step 9 from proof even (
previous step
)
((2 * i0) * (2 * i0 + 1) + 1 * (2 * i0 + 1)) % 2 = 0 ⊦
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 10
:
⊦ 1 * i = i
Proof step 11
:
((2 * i0) * (2 * i0 + 1) + 2 * i0 + 1) % 2 = 0 ⊦
Rule argument
spec: int-mult name: one seq: ⊦ 1 * i = i subst: [i] → [2 * i0 + 1] flags: <all paths>
Additional information
Used terms: 2 * i0 + 1