AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeCont.run_pure

theoremverifiedformalizationimported Lean

Cslib.FreeM.FreeCont.run_pure

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.FreeM Cslib.FreeM.FreeCont in
universe u v w w' w'' in
variable {r : Type u} {α : Type v} {β : Type w} in
@[simp]
lemma Cslib.FreeM.FreeCont.run_pure (a : α) (k : α → r) :
    run (pure a : FreeCont r α) k = k a
Formalizes
CSLib, `Cslib.FreeM.FreeCont.run_pure`
Lean proof
By Tanner Duve, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Tanner Duve. 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 39
Used by 12

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.FreeM Cslib.FreeM.FreeCont in
universe u v w w' w'' in
variable {r : Type u} {α : Type v} {β : Type w} in
@[simp]
lemma Cslib.FreeM.FreeCont.run_pure (a : α) (k : α → r) :
    run (pure a : FreeCont r α) k = k a := rfl
See it in the graphDiscuss this resultChallenge it