[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 11 from proof min-0 (
previous step
)
(n1 < n2 ⊃ n1;n2) = 0 ⊦ n0 = 0, n1 = 0, n2 = 0
Heuristic nonsplitting cut applied rule cut formula
And closed the goal!
Rule argument
fma: n1 < n2
Additional information
Used formulas: n1 < n2