AFTD Auto-Formalizing Theoretical Domains

Cslib.LambdaCalculus.LocallyNameless.Context.mapVal_mem

theoremverifiedformalizationimported Lean

A mapping of values maps lookups.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LambdaCalculus Cslib.LambdaCalculus.LocallyNameless Cslib.LambdaCalculus.LocallyNameless.Context in
universe u v in
variable {α : Type u} {β : Type v} in
variable [DecidableEq α] in
open List in
attribute [local grind =] Option.mem_def in
attribute [local grind _=_] List.append_eq in
attribute [local grind =] List.Nodup in
attribute [local grind _=_] List.singleton_append in
attribute [local grind =] Option.or_eq_some_iff in
attribute [local grind =] Option.or_eq_none_iff in
attribute [local grind _=_] List.mem_toFinset in
attribute [local grind =] List.nodupKeys_middle in
attribute [local grind →] List.perm_nodupKeys in
variable {Γ Δ : Context α β} in
lemma Cslib.LambdaCalculus.LocallyNameless.Context.mapVal_mem (mem : σ ∈ Γ.dlookup x) (f) : f σ ∈ (Γ.mapVal f).dlookup x
Formalizes
CSLib, `Cslib.LambdaCalculus.LocallyNameless.Context.mapVal_mem`
Lean proof
By Chris Henson, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Chris Henson. 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.
What was changed in Cslib.LambdaCalculus.LocallyNameless.Context.mapVal_mem
--- Cslib/Languages/LambdaCalculus/LocallyNameless/Context.lean:81 (Cslib.LambdaCalculus.LocallyNameless.Context.mapVal_mem)
+++ as compiled here
@@ -1,3 +1,19 @@
-/-- A mapping of values maps lookups. -/
-lemma mapVal_mem (mem : σ ∈ Γ.dlookup x) (f) : f σ ∈ (Γ.mapVal f).dlookup x := by
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Cslib Cslib.LambdaCalculus Cslib.LambdaCalculus.LocallyNameless Cslib.LambdaCalculus.LocallyNameless.Context in
+universe u v in
+variable {α : Type u} {β : Type v} in
+variable [DecidableEq α] in
+open List in
+attribute [local grind =] Option.mem_def in
+attribute [local grind _=_] List.append_eq in
+attribute [local grind =] List.Nodup in
+attribute [local grind _=_] List.singleton_append in
+attribute [local grind =] Option.or_eq_some_iff in
+attribute [local grind =] Option.or_eq_none_iff in
+attribute [local grind _=_] List.mem_toFinset in
+attribute [local grind =] List.nodupKeys_middle in
+attribute [local grind →] List.perm_nodupKeys in
+variable {Γ Δ : Context α β} in
+lemma Cslib.LambdaCalculus.LocallyNameless.Context.mapVal_mem (mem : σ ∈ Γ.dlookup x) (f) : f σ ∈ (Γ.mapVal f).dlookup x := by
   induction Γ <;> grind
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.LambdaCalculus Cslib.LambdaCalculus.LocallyNameless Cslib.LambdaCalculus.LocallyNameless.Context inuniverse u v invariable {α : Type u} {β : Type v} invariable [DecidableEq α] inopen List inattribute [local grind =] Option.mem_def inattribute [local grind _=_] List.append_eq inattribute [local grind =] List.Nodup inattribute [local grind _=_] List.singleton_append inattribute [local grind =] Option.or_eq_some_iff inattribute [local grind =] Option.or_eq_none_iff inattribute [local grind _=_] List.mem_toFinset inattribute [local grind =] List.nodupKeys_middle inattribute [local grind →] List.perm_nodupKeys invariable {Γ Δ : Context α β} in/-- A mapping of values maps lookups. -/lemma Cslib.LambdaCalculus.LocallyNameless.Context.mapVal_mem (mem : σ ∈ Γ.dlookup x) (f) : f σ ∈ (Γ.mapVal f).dlookup x := by  induction Γ <;> grind
See it in the graphDiscuss this resultChallenge it