summaryrefslogtreecommitdiff
path: root/library/set.tex
AgeCommit message (Collapse)Author
38 hoursStabilize one-core set proofsadelon
3 daysAlign successor with canonical set insertionadelon
Exact definitions remain named globals, so suc spells the canonical construction directly to coalesce with the packaged successor.
3 daysSeparate ordered tuples from PairSetadelon
3 daysRewrite protected set and naturals closureadelon
2026-07-03Track ownership of top-level symbolsadelon
Require every ownable top-level symbol to be introduced by a dedicated owner before it can appear in facts. Reject duplicate ownership and prevent symbols used by inductive definitions from being defined later. Use the ownership/dependency information to reject hidden recursive inductive definitions and to generate referenceable inductive principles. BREAKING CHANGE: Top-level facts no longer introduce symbols implicitly.
2026-04-12Make handling of local variables stricteradelon
2025-07-16Add quantified calcs and relax tokenizationadelon
Use an `\iff`-calc to speed up `union_as_unions`. Also remove `in_implies_neq` which seems to interact badly with the choice axiom used by superposition-based proofs like Vampire in cut-down problems.
2025-07-08Linting and optimizationadelon
2025-07-07Basic proofsadelon
2025-07-07Update set.texadelon
2024-06-25Improvement for the ATP proof timeSimon-Kor
2024-05-28Pow closed under binary intersectionadelon
2024-05-25Prove `emptyset_open` to replace structure axiomadelon
2024-05-21Add simple lemmas on filtersadelon
2024-02-10Initial commitadelon