[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 18 from proof iterate-subseq (
previous step
)
((f ^ n0))(λ x. false) ⊆ ((f ^ (n0 + 1)))(λ x. false) ⊦ f(((f ^ n0))(λ x. false)) ⊆ f(f(((f ^ n0))(λ x. false))), ((f ^ n0))(λ x. false) ⊆ f(((f ^ n0))(λ x. false))
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 19
:
⊦ ((f ^ (n + 1)))(S) = f(((f ^ n))(S))
Rule argument
spec: inst: name: iterate-rec seq: ⊦ ((f ^ (n + 1)))(S) = f(((f ^ n))(S)) subst: [S, n, f] → [λ x. false, n0, f] flags: rewrite, current
Additional information
Used terms: λ x. false, n0, f