A cell meets the stage at s iff its birth-supremum strictly exceeds s
ProvedPersistClust.Count.meets_iff_birth_supLet ι be a type, stage : ℝ → Set ι a stage family and J : ℝ → ι → ι → Prop a relation family satisfying the filtration law hLaw and the tameness module axioms hTame. For real levels t ≤ s such that s differs from the birth-supremum of every t-cell (hs), a t-cell C meets the stage image at s — i.e. C.val belongs to the image of stage s under x ↦ {y | J t x y} — if and only if s is strictly below the birth-supremum of C: C.val ∈ ((fun x => {y | J t x y}) '' stage s) ↔ s < birthSup hLaw t C. Forward: the s-class of a witnessing point x ∈ stage s is a component at s whose structMap down to t is C, so s is an ancestor level of C, giving s ≤ sSup (AncSet) = birthSup with equality excluded by hs. Backward: s < birthSup produces, by the supremum property of the ancestor-level set, an ancestor level u > s with a u-cell mapping to C; the representative point of that cell lies in stage s by antitonicity and its t-class is exactly C.val (t3_desc_point).
import Mathlib import Definitions.Def_PersistClust_Count_Setting import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_FiltrationLaw import Definitions.Def_PersistClust_Count_MatchingCensus open PersistClust.Count open scoped ENNReal
namespace PersistClust.Count
theorem meets_iff_birth_sup {ι : Type*} {stage : ℝ → Set ι} {J : ℝ → ι → ι → Prop}
(hLaw : FiltrationLaw stage J) (hTame : IsTameModule stage J)
{s t : ℝ} (hst : t ≤ s)
(hs : ∀ C : comps stage J t, s ≠ birthSup hLaw t C) (C : comps stage J t) :
C.val ∈ ((fun x => {y | J t x y}) '' stage s) ↔ s < birthSup hLaw t C
:= by sorry