[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 unique-elems-subset
⊦ bag0 ⊆ bag1 ∧ unique-elems(bag1) → unique-elems(bag0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
unique-elems-rem
,
Used by units in proved state:
ubi-base
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 8
Used lemmas:
unique-elems
,
Used spec theorems:
bag-union
/nat-bag/
count-subset
Used simplifier rules:
nat-basic
/
one
nat
/
le-def
nat
/
let
nat
/
one-02