[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
,
Theorem min-def
⊦ mon<(nσ) → (nσ = [] ⊃ min(nσ, n) = 0 ;(# nσ ≠ ∞ ∧ nσ[(# nσ).n - 1] < n ⊃ min(nσ, n) = (# nσ).n ;⌜min(nσ, n)⌝ < # nσ ∧ n ≤ nσ[min(nσ, n)] ∧ (∀ m. ⌜m⌝ < # nσ ∧ n ≤ nσ[m] → min(nσ, n) ≤ m) ) )
Type: An axiom
Validity: The proof is valid.
Features:
Comment: Skolem function justified by theorems min-skolemf
Used by:
min-empty
,
min-stutters
,
min-zero
,
mininv-inverts
,
mininv-inverts-inner
,
mininv-inverts-inner-succ
,
mininv-inverts-weak
,
mininv-stays-if-not-taken
,
Used by units in proved state:
Proof exists?: No