[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 1 from proof min-inf2 (conclusion)
⊦ min(n∞, ∞) = n∞
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ min(n∞, n∞0) = (n∞ < n∞0 ⊃ n∞;n∞0)
Proof step 3
:
⊦ (n∞ < ∞ ⊃ n∞;∞) = n∞
Rule argument
spec: inst: name: min-def seq: ⊦ min(n∞, n∞0) = (n∞ < n∞0 ⊃ n∞;n∞0) subst: [n∞0, n∞] → [∞, n∞] flags: rewrite, current
Additional information
Used terms: ∞, n∞