[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 at-copy (
previous step
)
m0 < # ar1 ⊦ ar1[m0] = (m0 < n0 ∨ n0 ≤ m0 ⊃ ar1[m0];ar0[m0 + n - n0])
Heuristic nonsplitting cut applied rule cut formula
And closed the goal!
Rule argument
fma: m0 < n0
Additional information
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) Used formulas: m0 < n0