[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 subsize-eq-01 (
previous step
)
# s = # s0, s ⊆ s0 ⊦ s = s0
User applied rule insert lemma
And obtained the following new goals
Proof step 3
:
⊦ s ⊆ s0 ∧ # s = # s0 → s = s0
Rule argument
spec: set-basic inst: name: subsize-eq seq: ⊦ s ⊆ s0 ∧ # s = # s0 → s = s0 subst: [s, s0] → [s, s0] flags: current, []
Additional information
Used terms: s, s0