[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 21 from proof to-to-leq-inf (
previous step
)
∀ m, nf. m ≤ n0 → (nf to n0) to m = nf to m ⊦ (nf to n0) to n0 = nf to n0
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 1 terms: n0, nf
Additional information
Used simplifier rules: ler: ⊦ m ≤ m; from specification nat Used terms: n0, nf