AFTD Auto-Formalizing Theoretical Domains

order_graph_is_complete

def

An order graph G is complete in the bidirectional model if for every subset S ⊆ Fin d and every element x : Fin d with x ∉ S, G serves requirement (S, x).

Statement

def order_graph_is_complete {d : ℕ} (G : OrderGraph d) : Prop
Defined in
arXiv:2610.39311 Definition 3
Verified
31 Oct 2026
Axioms
none listed
Built on 2
  • OrderGraphAn order graph of dimension d is a structure consisting of a finite set V of orders of Fin d and a finite set E of edges (π, a) where π :…
  • order_graph_servesAn order graph G serves requirement (S, x) where S is a finite set of Fin d and x : Fin d if there exists a nonempty list of edges p all…
Used by 4

Read back from the Lean

For a fixed dimension $d : ℕ$ and an order graph $G : \text{OrderGraph } d$, $G$ is complete if and only if for every subset $S \subseteq \text{Fin } d$ and every element $x : \text{Fin } d$ such that $x \notin S$, $G$ serves $(S, x)$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- An order graph is complete if it serves every requirement (S, x). -/
def order_graph_is_complete {d : ℕ} (G : OrderGraph d) : Prop := ∀ (S : Finset (Fin d)) (x : Fin d), x ∉ S → order_graph_serves G S x
See it in the graphDiscuss this resultChallenge it