[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 1 from proof stutf-alltaken (conclusion)
⊦ stutf(nσ) ∧ ⌜m⌝ < # nσ ∧ n ≤ nσ[m] → (∃ m0. m0 ≤ m ∧ nσ[m0] = n)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
⌜m⌝ < # nσ, stutf(nσ), n ≤ nσ[m] ⊦ ∃ m0. m0 ≤ m ∧ nσ[m0] = n
Rule argument
Additional information