[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 27 from proof modify-sym (
previous step
)
¬ r1 ∈ rs ∧ r1 ∈ H0 ∧ H1 = H0 -- r1 ⊦ ∃ n. rtc(n, modify(rs))(H1, H0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 28
:
r1 ∈ H0 ⊦ r1 ∈ rs, ∃ n. rtc(n, modify(rs))(H0 -- r1, H0)
Rule argument
Additional information