[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 20 from proof rg-restr2 (
previous step
)
Gr(m)(s, s0) → (∀ n. n ≠ m → Ry(n)(s, s0)), Gr(m)(s, s0), m ≤ n0 ⊦ Ry(n0 + 1)(s, s0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 21
:
Gr(m)(s, s0), m ≤ n0, ∀ n. n ≠ m → Ry(n)(s, s0) ⊦ Ry(n0 + 1)(s, s0)
Rule argument
Additional information