[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
,
Theorem finset-nextfin
finout(g) ⊦ ∀ s. ∃ s0. ∀ b. b ∈ s0 ↔ (∃ a. a ∈ s ∧ edge(g)(a, b))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
finreach-fin
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 36
Used lemmas:
finout-def
,
Used spec theorems:
Used simplifier rules:
set-basic
/
size-zero-01
set-basic
/
ne-01
set-union
/
del-size
nat
/
le-def
nat-basic
/
one-01
nat
/
ls-01
nat-basic
/
s-04
nat-basic
/
refl-Nat
nat-basic
/
a
nat-basic
/
c
set-union
/
Delete
set-union
/
unc
set-union
/
una
set-union
/
Union
set-basic
/
In-empty