Corpus v3 · Formal theorem
cid005339
FTH0077canonicalv1no_comprehension (theorem)
/-- [I.P35] No comprehension separator exists in tau-arithmetic. Proof: apply Sep to the Russell predicate P(a) = not(a in_tau a). For R = Sep(P), the comprehension schema gives a in_tau R iff not(a in_tau a). At a = R: R in_tau R iff not(R in_tau R). But R in_tau R holds by reflexivity (R | R), so not(R in_tau R) also holds -- contradiction. -/
Formalization
lean_axiom_freesorries: 0project axioms: 0
Identifiers
Aliases & legacy IDs
no_comprehensionno-comprehensionTauLib.BookI.Sets.CantorRefutation::no_comprehensionRelease lines
corpus_v2corpus_v3_workingVersion & History
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.