Relation.refl_serial
theoremverifiedformalizationimported Lean
Relation.refl_serial
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relator in variable {α : Type*} {r : α → α → Prop} in @[scoped grind →] lemma Relation.refl_serial (r : α → α → Prop) (h : Std.Refl r) : Serial r
- Formalizes
- CSLib, `Relation.refl_serial`
- 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.refl_serial← Relation.refl_serial (Cslib/Foundations/Relation/Euclidean.lean:41): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 1
- Relation.SerialA relation
ris serial if every element isReducible, i.e.Relator.LeftTotal.
- Relation.SerialA relation
- Used by 1
- Relation.instSerialOfReflRelation.instSerialOfRefl
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relator in variable {α : Type*} {r : α → α → Prop} in @[scoped grind →] lemma Relation.refl_serial (r : α → α → Prop) (h : Std.Refl r) : Serial r where serial a := ⟨a, h.refl a⟩