[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 5 from proof restr-toset-empty-notin (
previous step
)
@(n, m0, m1) ∈ ax, ∀ adr. adr ∈ ax.toSet | n ↔ adr ∈ ∅ ⊦
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 6
:
@(n, m0, m1) ∈ ax, ∀ adr. ¬ adr ∈ ax.toSet | n ⊦
Rule argument
Additional information
Used simplifier rules: ⊦ ¬ adr ∈ ∅; (s)