Undone hold returns
ProvedAPFPaper5.K3.undone_hold_returnsapfapf-referencesib-v44-2026-11
Supporting lemma: undone hold returns. The exact quantified statement supplied with this entry is controlling, including every displayed hypothesis. Finite Process and injectivity are supplied. Finite words individually do not make their whole type finite, and B04 does not establish that finiteness.
Preamble
import Definitions.Def_APF_B01_DeclaredInput import Mathlib.Data.Fintype.Pigeonhole import Mathlib.Data.Finite.Prod import Mathlib.Logic.Function.Iterate set_option autoImplicit false universe uX uP namespace APFPaper5.K3 end APFPaper5.K3 open APFPaper5.K3
Formal statement
theorem APFPaper5.K3.undone_hold_returns {S : Type*} [Finite S] (D : S → S) (hD : Function.Injective D)
(x : S) : ∃ n : ℕ, 0 < n ∧ D^[n] x = x := by sorry
Source
Sib v44 Theorems/Thm_APFB01_undone_hold_returns.lean:45
Human review
Confirmed by the mission captain (proposal self-audit).