[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 ext
⊦ s1 = s2 ↔ (∀ a. a ∈ s1 ↔ a ∈ s2)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
del
,
del-addeq
,
del-addeq-01
,
del-addeq-02
,
del-addeq-04
,
del-addeq-05
,
del-addeq-06
,
del-d-01
,
del-e
,
del-e-02
,
del-eq
,
del-feq
,
del-feq-01
,
del-feq-02
,
del-in
,
del-in-03
,
del-neq-01
,
del-neq-02
,
del-two
,
delete-insert
,
delsw
,
delsw-02
,
diff-add-del
,
diff-del
,
diff-e
,
diff-e-01
,
diff-empty
,
diff-idem
,
diff-int
,
diff-int-01
,
diff-rc
,
diff-union-03
,
equal-add-in
,
indef
,
insdel-sub
,
int-a
,
int-c
,
int-del-rew
,
int-empty
,
int-empty-01
,
int-empty-02
,
int-eq
,
int-ins
,
int-inserte
,
int-notempty
,
int-notempty-01
,
intdel-empty
,
intexin
,
one-min
,
selsub-diff
,
sub-ade
,
sub-ade-01
,
sub-ade-02
,
sub-ade-03
,
sub-del
,
sub-del-03
,
sub-del-04
,
sub-union
,
sub-union-01
,
subdef
,
subsub-del
,
una
,
unadd
,
unadd-01
,
unall
,
unc
,
undel
,
undel-01
,
undel-02
,
undel-04
,
undel-05
,
undel-06
,
une-01
,
uneq
,
union-difference
,
union-rewone
,
union-sub
,
union-sub-01
,
unsub-union-01
,
unsubdel
,
unsubdel-01
,
unsubsub
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 8
Used lemmas:
Used spec theorems:
infset-union
/
ext
Used simplifier rules:
infset-basic
/
ne-01