[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 fidb-diff-one
⊦ fid0 ∈ fidb ∧ fid0 ≠ fid1 → fid0 ∈ fidb \ {fid1}
Type: A user defined theorem
Validity: The proof is valid.
Features: lss, ss,
Comment:
Used by:
Used by units in proved state:
posix-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
Used spec theorems:
bag-union
/fidbag/
in
bag-union
/fidbag/
difference
Used simplifier rules:
bag-union
/fidbag/
count-one
nat
/
lez
nat
/
sub-base