[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-union
⊦ s ≠ ∅ ∧ s0 ≠ ∅ → (s ∪ s0).min = (s.min < s0.min ⊃ s.min;s0.min)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 15
Used lemmas:
min-rec
,
min-inn
,
max-in
,
Min-in
,
Max-in
,
Used spec theorems:
Used simplifier rules:
set-basic
/
size-zero
set-basic
/
size-zero-01
set-basic
/
ne
set-union
/
unc
set-union
/
una
set-union
/
unadd
set-basic
/
size-zero-02
set-union
/
une
set-basic
/
size-one-01
set-union
/
une-01
weakord
/tord/
lel
weakord
/tord/
transitivity
weakord
/tord/
irreflexivity
weakord
/tord/
leq-trans
weakord
/tord/
nen
weakord
/tord/
nll
tord
/
sls