[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 in-ri-update-in-ri (conclusion)
# ax0 = # ax ⊦ ax0.toSet ⊆ range ri ∧ ri-cons(ri, fs) → (key ∈ ri[keys(fs, ax0), ax] ↔ key ∈ ri)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
# ax0 = # ax, ri-cons(ri, fs), ax0.toSet ⊆ range ri ⊦ key ∈ ri[keys(fs, ax0), ax] ↔ key ∈ ri
Rule argument
Additional information