LeanMachineLearning

Learning.fst_eval_comp_history๐Ÿ”—

Lemma

No docstring.

๐Ÿ”—theorem
Learning.fst_eval_comp_history.{u_1, u_2, u_3} {๐“ : Type u_1}
  {๐“จ : Type u_2} {ฮฉ : Type u_3} {A : โ„• โ†’ ฮฉ โ†’ ๐“} {Y : โ„• โ†’ ฮฉ โ†’ ๐“จ}
  (n : โ„•) : (fun x => Prod.fst (x โŸจn, โ‹ฏโŸฉ)) โˆ˜ history A Y n = A n
Learning.fst_eval_comp_history.{u_1, u_2,
    u_3}
  {๐“ : Type u_1} {๐“จ : Type u_2}
  {ฮฉ : Type u_3} {A : โ„• โ†’ ฮฉ โ†’ ๐“}
  {Y : โ„• โ†’ ฮฉ โ†’ ๐“จ} (n : โ„•) :
  (fun x => Prod.fst (x โŸจn, โ‹ฏโŸฉ)) โˆ˜
      history A Y n =
    A n

Code

lemma fst_eval_comp_history (n : โ„•) :
    (fun x โ†ฆ (x โŸจn, by simpโŸฉ).1) โˆ˜ (history A Y n) = A n
Proof
rfl

Actions: Source ยท Open Issue

Meaning unchanged since v4.33.0-rc1-29-gce231eb, the oldest revision on record (2026-07-30).

Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file ยท open it in the Lean web editor.

Dependency graph

Audit surface: 1 project declarations, 26 external constants

โœ“ Proved: no sorry anywhere in its closure

This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.