[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 2 from proof keys-same-fs (
previous step
)
fs0 | ax1.toSet = fs1 | ax1.toSet ⊦ keys(fs0, ax1) = keys(fs1, ax1)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
fs0 | ax1.toSet = fs1 | ax1.toSet ⊦ keys(fs0, ax1) = keys(fs1, ax1)
Rule argument
Additional information