AFTD Auto-Formalizing Theoretical Domains

Set.LeftQuasiRefl

abbrevimported Lean

LeftQuasiRefl r is true when a relation r is reflexive on its domain.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Relation in
abbrev Set.LeftQuasiRefl (r : α → α → Prop)
Defined in
CSLib, `Set.LeftQuasiRefl`
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 listed
Built on 2
  • Relation.domDomain of a relation.
  • Set.ReflOnReflOn s r is true when a relation r is reflexive on its restriction to a set s.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Relation in
/-- `LeftQuasiRefl r` is true when a relation `r` is reflexive on its domain. -/
abbrev Set.LeftQuasiRefl (r : α → α → Prop) := (dom r).ReflOn r
See it in the graphDiscuss this resultChallenge it