AFTD Auto-Formalizing Theoretical Domains

Relation.mem_cod

theoremverifiedformalizationimported Lean

Relation.mem_cod

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {β : Type*} {r : α → β → Prop} in
@[simp, grind =] lemma Relation.mem_cod : b ∈ cod r ↔ ∃ a, r a b
Formalizes
CSLib, `Relation.mem_cod`
Lean proof
By Fabrizio Montesi, Thomas Waring, Chris Henson, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Fabrizio Montesi and Thomas Waring. 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 1
Used by 9

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {β : Type*} {r : α → β → Prop} in
@[simp, grind =] lemma Relation.mem_cod : b ∈ cod r ↔ ∃ a, r a b := .rfl
See it in the graphDiscuss this resultChallenge it