[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 21 from proof three (
previous step
)
i * 2 = 3, i < 3, 1 < i, 0 < i ⊦ i = 3
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 22
:
⊦ 2 * i ≠ 3
Rule argument
spec: <toplevel> name: three-01 seq: ⊦ 2 * i ≠ 3 subst: [i] → [i] flags: <all paths>
Additional information
Used simplifier rules: commutativity: ⊦ i * j = j * i; Used terms: i