Corpus proposition canonical 2026-05-27T20:53:50+00:00
Corpus v3 · Proposition cid001155PRP0033canonicalv1

No Unrestricted Comprehension

No unrestricted comprehension: tau-sets are bounded powersets (divisor sets), not arbitrary collections. The set {x : x divides n} is always finite, blocking Russell-type diagonal constructions.

Payload

No Unrestricted Comprehension

No unrestricted comprehension: tau-sets are bounded powersets (divisor sets), not arbitrary collections. The set {x : x divides n} is always finite, blocking Russell-type diagonal constructions.

No Unrestricted Comprehension

Summary

No unrestricted comprehension: tau-sets are bounded powersets (divisor sets), not arbitrary collections. The set {x : x divides n} is always finite, blocking Russell-type diagonal constructions.

Statement

%
\label{prop:no-comprehension}
Category~$\tau$ has no comprehension scheme.
The only set-formation principle is the
\textbf{bounded powerset}
$\mathcal{P}_\tau(\underline{x})
= \{\underline{a} : \underline{a} \mid \underline{x}\}$
(Definition~\ref{def:bounded-powerset}),
which is finite for every $\underline{x}$.
There is no mechanism to form
``the set of all objects satisfying property~$\varphi$''
for an arbitrary predicate~$\varphi$.

Proof / Justification

In $\tau$-set theory,
sets are natural numbers in $\tau$-Idx,
and membership is divisibility
(Chapter~\ref{ch:membership-divisibility}).
The powerset of $\underline{x}$ is the set of divisors
of $\underline{x}$, which is finite
(Proposition~\ref{prop:powerset-cardinality}).
To form a subset by comprehension,
one would need a mechanism
that takes a predicate $\varphi$
and returns a natural number $\underline{y}$
whose divisors are exactly those $\underline{a}$
satisfying $\varphi(\underline{a})$.
But the divisors of any natural number
are determined by its prime factorization ---
a fixed, finite, arithmetic structure ---
and there is no operation in $\tau$
that converts an arbitrary logical predicate
into a prime factorization.
The $\tau$-axioms provide only earned operations:
$\rho$ (successor), addition, multiplication,
exponentiation, tetration.
None of these constructs subsets from predicates.
Hence no comprehension schema exists in~$\tau$.

Source Context

  • Registry source: book-01.jsonl line 162
  • Manuscript source: 2nd-edition/book-i-categorical-foundations/02_mainmatter/part09/ch37-cantor-diagonal.tex lines 269-282

Lean / Formalization Notes

  • Formalization: formalized
  • Module: TauLib.BookI.Sets.CantorRefutation
  • Name: Tau.Sets.no_comprehension

Dependencies

  • Canonical: I.T35

Generated by later projection phases.

Generated by later projection phases.

Revision Notes

  • 2026-04-24: Initial pilot migration.

Identifiers

  • Corpus ID cid001155
  • Primary alias PRP0033
  • Type Proposition
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

I.P35no-unrestricted-comprehensionprop:no-comprehension

Release lines

corpus_v3_workingcorpus_v2

Relations

Formalized by (1)

Appears in (1)

Downstream uses (computed) (2)

Items in the corpus that reference this one via load-bearing relations. Computed from the full corpus-v3 graph at build time.

Sources

  • Monograph cid000023Book I, Part 9, Chapter 37 (Part IX)

Version & History

  • v1 · 2026-05-10 imported from v2 registry
  • v1 · 2026-05-10 wired formalized by in wave 5

Status disclaimer

A Corpus Item page reports the program's current internal record for this item. It does not imply external verification, scientific consensus, or final proof unless explicitly stated. Read it together with its dependencies, formalization status, and the program's overall stance.

Save or share this page for inspection

Download a portable dossier, copy a reviewer note, or send this page to someone who can inspect it.

Email to expert