AFTD Auto-Formalizing Theoretical Domains

standard_example_le

def

In the standard example S_k, min i ≤ max j if and only if i ≠ j, with no relations between two minimal or two maximal elements.

Statement

def standard_example_le {k : ℕ} : StandardExample k → StandardExample k → Prop
Defined in
arXiv:2610.24774 Section 1
Verified
20 Oct 2026
Axioms
none listed
Built on 1
  • StandardExampleThe standard example S_k of order k is a type with k minimal elements and k maximal elements.
Used by 1

Read back from the Lean

For a given natural number k, standard_example_le defines a binary relation on StandardExample k by cases: - standard_example_le (StandardExample.min i) (StandardExample.min j) holds if and only if i = j; - standard_example_le (StandardExample.min i) (StandardExample.max j) holds if and only if i ≠ j; - standard_example_le (StandardExample.max _) (StandardExample.min _) is False; - standard_example_le (StandardExample.max i) (StandardExample.max j) holds if and only if i = j.

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

/-- The partial order relation on the standard example: min i ≤ max j iff i ≠ j. -/
def standard_example_le {k : ℕ} : StandardExample k → StandardExample k → Prop
| StandardExample.min i, StandardExample.min j => i = j
| StandardExample.min i, StandardExample.max j => i ≠ j
| StandardExample.max _, StandardExample.min _ => False
| StandardExample.max i, StandardExample.max j => i = j
See it in the graphDiscuss this resultChallenge it