[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 6 from proof referenced-adrs-lookup-key-cons (
previous step
)
ri-cons(ri, fs), ri-cons(ri, fs) → key-cons(fs[referenced-adrs(ax0, ri)]) ⊦ key-cons(fs[(adr ∈ ri ⊃ adr ';[])]) ∧ key-cons(fs[referenced-adrs(ax0, ri)])
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 7
:
key-cons(fs[referenced-adrs(ax0, ri)]), ri-cons(ri, fs) ⊦ key-cons(fs[(adr ∈ ri ⊃ adr ';[])])
Rule argument
Additional information