Relation.cod_mono
theoremverifiedformalizationimported Lean
Relation.cod_mono
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {β : Type*} {r : α → β → Prop} in @[gcongr] lemma Relation.cod_mono (h : r₁ ≤ r₂) : cod r₁ ⊆ cod r₂
- Formalizes
- CSLib, `Relation.cod_mono`
- 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.Relation.cod_mono← Relation.cod_mono (Cslib/Foundations/Relation/Domain.lean:41): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- Relation.mem_codRelation.mem_cod
- Relation.codCodomain of a relation, aka range.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {β : Type*} {r : α → β → Prop} in @[gcongr] lemma Relation.cod_mono (h : r₁ ≤ r₂) : cod r₁ ⊆ cod r₂ := fun b ⟨a, hab⟩ => ⟨a, h a b hab⟩