pyranim_mem_remove_iff
A 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 deletes exactly the chips that contain it.
Statement
theorem pyranim_mem_remove_iff (X : Finset (ℕ × ℕ)) (c x : ℕ × ℕ) :
x ∈ pyranim_remove X c ↔ x ∈ X ∧ ¬ pyranim_chip_sub c x- Source
- step towards pyranim_game_iso_iff_graph_iso
- Verified
- 15 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- 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.
- pyranim_removeThe position resulting from removing chip c = (i, j) from X, which removes c and all chips (a, b) in X that contain (i, j) (satisfying a ≤…
- planar_necklace_injective_projectionFor every finite set P of points of ℝ² there is a nonzero linear functional φ : ℝ² → ℝ that is injective on P: if p, q ∈ P and φ p = φ q…
The proof, explained
By definition, `pyranim_remove X c` is the sub-collection of chips in X obtained by filtering out those that contain c (meaning x.1 ≤ c.1 and c.2 ≤ x.2). Since this containment condition is precisely `pyranim_chip_sub c x`, the characterization follows immediately from the definition of `Finset.filter`.
x ∈ pyranim_remove X c ↔ x ∈ X ∧ ¬ pyranim_chip_sub c x
Unfolding the definitions, `pyranim_remove X c` is defined as `X.filter (fun ⟨a, b⟩ => ¬ (a ≤ c.1 ∧ c.2 ≤ b))` and `pyranim_chip_sub c x` is defined as `x.1 ≤ c.1 ∧ c.2 ≤ x.2`. By the defining property of `Finset.filter`, an element `x` belongs to `X.filter p` if and only if `x ∈ X` and `p x` holds. Applying this equivalence directly reduces both sides to the same condition.
uses
planar_necklace_injective_projectionx ∈ pyranim_remove X c ↔ x ∈ X ∧ ¬ pyranim_chip_sub c x := by first | exact planar_necklace_injective_projection | (apply planar_necklace_injective_projection <;> assumption) | (apply planar_necklace_injective_projection <;> simp_all) | simpa using planar_necklace_injective_projection | (simp only [pyranim_remove, pyranim_chip_sub] at *; first | exact planar_necklace_injective_projection | (apply planar_necklace_injective_projection <;> assumption) | (apply planar_necklace_injective_projection <;> simp_all) | simpa using planar_necklace_injective_projection)
planar_necklace_injective_projection- For any finite subset of ℝ², there exists a non-zero linear projection to ℝ that is injective on that subset.
- The proof script uses an automated hammer template `first | ... | simpa using planar_necklace_injective_projection`. The referenced lemma `planar_necklace_injective_projection` is completely unrelated to the statement; `simpa` simply simplifies the membership condition for `Finset.filter`.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Removal is deletion of the principal filter: x survives playing c iff x ∈ X and c is not a subinterval of x. -/theorem pyranim_mem_remove_iff (X : Finset (ℕ × ℕ)) (c x : ℕ × ℕ) : x ∈ pyranim_remove X c ↔ x ∈ X ∧ ¬ pyranim_chip_sub c x := by first | exact planar_necklace_injective_projection | (apply planar_necklace_injective_projection <;> assumption) | (apply planar_necklace_injective_projection <;> simp_all) | simpa using planar_necklace_injective_projection | (simp only [pyranim_remove, pyranim_chip_sub] at *; first | exact planar_necklace_injective_projection | (apply planar_necklace_injective_projection <;> assumption) | (apply planar_necklace_injective_projection <;> simp_all) | simpa using planar_necklace_injective_projection)