[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
,
Proof step 2 from proof subset-emp (
previous step
)
bag ⊆ ∅ ⊦ bag = ∅
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 3
:
⊦ bag = ∅ ↔ ¬(∃ a. a ∈ bag)
Proof step 4
:
bag ⊆ ∅ ⊦ ∀ a. ¬ a ∈ bag
Rule argument
spec: <toplevel> name: some seq: ⊦ bag = ∅ ↔ ¬(∃ a. a ∈ bag) subst: [bag] → [bag] flags: <all paths>
Additional information
Used terms: bag