[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 36 from proof pushx-inv (conclusion)
⊦ inv(ixs, # x) → (¬ inv(pushx(# x, ixs, x + a '), # x + 1) ↔ false)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 35
:
inv(ixs, # x) ⊦ inv(pushx(# x, ixs, x + a '), # x + 1)
Rule argument
Additional information
[Concretesimprules(())]