accessible_count_eq_23
plain-language theorem explainer
The theorem asserts that exactly 23 of the 27 canonical superhuman powers admit an accessible Recognition Science path. Researchers working on the σ-Resolution Superhero Thesis cite the count when separating direct or derivable mechanisms from constrained cases. The proof reduces to native computation on the enumerated list of powers.
Claim. Let $P$ be the complete list of 27 canonical superhuman powers. The cardinality of the sublist of powers that admit an accessible RS path equals 23.
background
The Superhuman Core module formalizes the σ-Resolution Superhero Thesis power taxonomy. It classifies 27 powers into five epistemic classes A–E by RS mechanism type, with Power as the inductive enumeration of canonical abilities drawn from mythology, comics, and folklore. The definition allPowers constructs the exhaustive list of these 27 entries. The upstream result powerCount_eq_27 confirms the taxonomy is complete at 27 powers.
proof idea
The proof is a one-line wrapper that invokes native_decide to evaluate the length of the filtered list of accessible powers directly from the definition of allPowers and the accessibility predicate on Power.
why it matters
This result partitions the power taxonomy into 23 accessible and 4 constrained powers, supporting the module's claim hygiene distinction between structural theorems and empirical hypotheses. It completes the enumeration required by the σ-Resolution Superhero Thesis and aligns with the Recognition Science forcing chain by identifying which powers follow from J-uniqueness and phi-ladder mechanisms.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.