[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 11 from proof modify-sym (
previous step
)
⊦ r = null, r ∈ H0, r ∈ rs, ∃ n. rtc(n, modify(rs))(H0 ++ r, H0)
User applied rule exists right
And obtained the following new goals
Proof step 12
:
⊦ r = null, r ∈ H0, r ∈ rs, rtc(1, modify(rs))(H0 ++ r, H0)
Rule argument
pos: right 4 terms: 1 abort: F discard: T computed: F
Additional information
Used terms: 1