[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 write-shift (conclusion)
# ax = # ndx ⊦ ¬ adr ∈ ax → fs[adr, nd][ax, ndx] = fs[ax, ndx][adr, nd]
System applied rule normalize
And obtained the following new goals
Proof step 2
:
# ax = # ndx ⊦ fs[adr, nd][ax, ndx] = fs[ax, ndx][adr, nd], adr ∈ ax
Rule argument
Additional information