AFTD Auto-Formalizing Theoretical Domains

Cslib.Algorithms.Lean.TimeM.ret_map

theoremverifiedformalizationimported Lean

Cslib.Algorithms.Lean.TimeM.ret_map

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
@[simp, grind =] theorem Cslib.Algorithms.Lean.TimeM.ret_map {α β} (f : α → β) (x : TimeM T α) : (f <$> x).ret = f x.ret
Formalizes
CSLib, `Cslib.Algorithms.Lean.TimeM.ret_map`
Lean proof
By Sorrachai Yingchareonthawornhcai, Eric Wieser, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Sorrachai Yingchareonthawornhcai. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 8
Used by 20

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
@[simp, grind =] theorem Cslib.Algorithms.Lean.TimeM.ret_map {α β} (f : α → β) (x : TimeM T α) : (f <$> x).ret = f x.ret := rfl
See it in the graphDiscuss this resultChallenge it