[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 2 from proof leninv-invlast-inv-2 (
previous step
)
# nσ = # nσ0, # nσ0 = ⌜m⌝ + ⌜1⌝ , leninv(nσ) = ⌜n⌝ + ⌜1⌝ , stutf(nσ) ⊦ inv(nσ)[n] = m
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
# nσ0 = ⌜m⌝ + ⌜1⌝ , # nσ = # nσ0, leninv(nσ) = ⌜n⌝ + ⌜1⌝ , stutf(nσ) ⊦ inv(nσ)[n] = m
Rule argument
Additional information