AFTD Auto-Formalizing Theoretical Domains

Relation.dom_eq_empty_iff

theoremverifiedformalizationimported Lean

Relation.dom_eq_empty_iff

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {β : Type*} {r : α → β → Prop} in
@[simp, grind =]
lemma Relation.dom_eq_empty_iff : dom r = ∅ ↔ r = emptyHRelation
Formalizes
CSLib, `Relation.dom_eq_empty_iff`
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
Classical.choiceQuot.soundpropext
Built on 7
Used by 6

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {β : Type*} {r : α → β → Prop} in@[simp, grind =]lemma Relation.dom_eq_empty_iff : dom r = ∅ ↔ r = emptyHRelation where  mp h := by    ext a b    simp    grind => have : a ∈ dom r; finish  mpr := by grind
See it in the graphDiscuss this resultChallenge it