[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-intempty
⊦ s ∩ s0 = ∅ ∧ s ≠ ∅ → (¬ ¬ s.min ∈ s0 ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
Min-in
,
Max-in
,
Min-min
,
Max-max
,
Used spec theorems:
Used simplifier rules:
set-union
/
int-empty-02
set-union
/
int-c
set-union
/
int-a
set-basic
/
size-zero-01
set-basic
/
ne-01