AFTD Auto-Formalizing Theoretical Domains

arrows_unmarked_decidable

instance

For a finite graph with decidable adjacency, whether u and v form an unmarked edge at p is decidable.

Statement

instance arrows_unmarked_decidable {V : Type*} (G : SimpleGraph V) [DecidableRel G.Adj]
    (p : ArrowsPos V) (u v : V) : Decidable (ArrowsUnmarked G p u v)
Source
step towards arrows_op602_refutation_tree_grundy_gt_three
Verified
28 Oct 2026
Axioms
none listed
Built on 2
  • ArrowsPosGiven a type V, ArrowsPos V is the subtype of boolean-valued binary relations p : V → V → Bool that are asymmetric, meaning that for all…
  • ArrowsUnmarkedIn a simple graph G and position p : ArrowsPos V, vertices u and v form an unmarked edge if G.Adj u v and both p.1 u v and p.1 v u are…

Lean source view module on GitHub

/-- Decidability of the unmarked-edge predicate, so that legality can be settled by kernel `decide`. -/
instance arrows_unmarked_decidable {V : Type*} (G : SimpleGraph V) [DecidableRel G.Adj]
    (p : ArrowsPos V) (u v : V) : Decidable (ArrowsUnmarked G p u v) := by unfold ArrowsUnmarked; infer_instance
See it in the graphDiscuss this resultChallenge it