[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 3 from proof size-subset (
previous step
)
st ⊆ st0, ∀ st1, st. # st1 < # st0 → st ⊆ st1 → # st ≤ # st1 ⊦ # st ≤ # st0
Heuristic simplifier applied rule simplifier
And closed the goal!
Rule argument
Additional information
Used simplifier rules: subset-size: ⊦ # st0 < # st → ¬ st ⊆ st0;% ⊦ m ≤ n ↔ ¬ n < m; (ss)