[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 15 from proof subset-size (
previous step
)
st1[a] = d ∧ a ∈ st1, # st0 < # st1, a ∈ st1, st1 ⊆ st0, ∀ st0. # st0 < # st1 → ¬ st1 ⊆ st0 ⊦ st1 = ∅, st1 = ∅
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 16
:
# st0 < # st1, a ∈ st1, st1 ⊆ st0, ∀ st0. # st0 < # st1 → ¬ st1 ⊆ st0 ⊦ st1 = ∅
Rule argument
Additional information