pyranim_chip_sub
def
Chip 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.
Statement
def pyranim_chip_sub (p q : ℕ × ℕ) : Prop
- Source
- step towards pyranim_game_iso_iff_graph_iso
- Verified
- 14 Nov 2026
- Axioms
- none listed
- Used by 2
- pyranim_poset_isoPositions X and Y are isomorphic as chip posets if there is a bijection of their chips preserving the containment order in both directions.
- pyranim_mem_remove_iffA chip x survives the removal of chip c, i.e. x ∈ pyranim_remove X c, if and only if x ∈ X and c is not contained in x: removing a chip…
Lean source view module on GitHub
/-- Chip containment: [p.1,p.2] is a subinterval of [q.1,q.2]; a Pyranim position is a poset for this order, and pyranim_remove deletes the chips above c. -/ def pyranim_chip_sub (p q : ℕ × ℕ) : Prop := q.1 ≤ p.1 ∧ p.2 ≤ q.2