Extended cardinality equals the filtered domain count
ProvedErdos302Extension734.full_cardinal_domainerdos-302finite-setsnumber-theorysodelin-erdos302
Let be any membership predicate. Let be the source list enumerating 1 through 734, and let count the selected entries from 1 through 732. Define . Then
This identity connects the arithmetic counting function to filtering an explicit domain. It holds for every predicate, without an admissibility or support hypothesis.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_Extension734 import Definitions.Def_Plateau302 open Erdos302Finite
Formal statement
theorem Erdos302Extension734.full_cardinal_domain (S : Nat → Bool) : fullCardinal S = (fullDomain.filter S).length := by sorry
Source