[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 26 from proof to-to-leq (
previous step
)
m < # x, n0 < # x, m ≤ n0, m ≤ n0 + 1, ∀ m, x. m ≤ n0 ∧ n0 ≤ # x ∧ m ≤ # x → x to n0 to m = x to m ⊦ x to n0 to m = x to m, x = []
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 5 terms: m, x
Additional information
Used simplifier rules: ⊦ m < n → m ≤ n; (s) Used terms: m, x