AFTD Auto-Formalizing Theoretical Domains

pyranim_poset_iso

def

Positions X and Y are isomorphic as chip posets if there is a bijection of their chips preserving the containment order in both directions.

Statement

def pyranim_poset_iso (X Y : Finset (ℕ × ℕ)) : Prop
Source
step towards pyranim_game_iso_iff_graph_iso
Verified
14 Nov 2026
Axioms
none listed
Built on 1
  • pyranim_chip_subChip p is contained in chip q (p = [p.1,p.2] is a subinterval of [q.1,q.2]); this is the containment order on chips.

Lean source view module on GitHub

/-- Order isomorphism of the chip posets (X, containment) and (Y, containment): a bijection reflecting pyranim_chip_sub both ways. -/
def pyranim_poset_iso (X Y : Finset (ℕ × ℕ)) : Prop := ∃ e : {c : ℕ × ℕ // c ∈ X} ≃ {d : ℕ × ℕ // d ∈ Y},
    ∀ a b : {c : ℕ × ℕ // c ∈ X},
      (pyranim_chip_sub a.1 b.1 ↔ pyranim_chip_sub (e a).1 (e b).1)
See it in the graphDiscuss this resultChallenge it