[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 5 from proof ext-rec (
previous step
)
# ar0 = # ar1 ∧ (∀ m. m < # ar0 → ar1[m] = (n = m ⊃ a;ar0[m])) ⊦ ar1 = ar0[n, a]
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 6
:
# ar0 = # ar1, ∀ m. m < # ar1 → ar1[m] = (n = m ⊃ a;ar0[m]) ⊦ ar1 = ar0[n, a]
Rule argument
Additional information