5 Commits

Author	SHA1	Message	Date
Danila Fedorin	a5f533d67a	Use a direct N-way unzip instead of induction over product size ... This makes a finite-height proof for any `Fin n -> a` lattice immediate, and precludes the need for IterProd and Prod altogether. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>	2026-06-26 12:16:04 -05:00
Danila Fedorin	352e0bb8cc	Fold Isomorphism module into Lattice.lean ... Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>	2026-06-26 12:16:04 -05:00
Danila Fedorin	cbad43efdc	Make FiniteHeightLattice extend Lattice and derive Top/Bot ... Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>	2026-06-25 18:55:09 -05:00
Danila Fedorin	e2df847139	Adopt lemma as the default keyword ... Convert every theorem to lemma (mathlib's default) except the headline results a reader of each module seeks out: analyze_correct (Forward/Sign/Constant), aFix_eq/aFix_le (Fixedpoint), trace (Language), and Stmt.cfg_sufficient (Language/Properties). lemma and theorem are interchangeable keywords, so no references change. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>	2026-06-25 14:08:10 -05:00
Danila Fedorin	5ac881559d	Switch FiniteMap Fin n -> L representation ... This helps automatically derive lattice laws for it Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com> Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>	2026-06-25 14:05:59 -05:00