mrwulf 801ae08fe8 L3: Theorem 1 (inclusion completeness) kernel-checked ... Path (prover-side inclusion path, paper SS5.3) with termination via the kbelow bounds; self-contained list lemmas (getD_take, getD_drop - no stdlib-name dependence); equation lemmas MTH_single/MTH_split/Root_one/ Root_left/Root_right (Option.map form; matcher side conditions closed explicitly); Theorem 1 by functional induction on Path with a k-fold discipline against the let-bound split point. incl_complete cone: [propext, Classical.choice, LTLAcc.sha256, Quot.sound] - pinned exactly in check.sh alongside Path. THE button green end to end. LTL untouched. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>		2026-07-11 12:06:20 +02:00
..
gen/LTLAcc	L1+L2: hashing shapes, domain separation, MTH/Root/ConsRec with termination	2026-07-10 23:58:00 +02:00
Proofs	L3: Theorem 1 (inclusion completeness) kernel-checked	2026-07-11 12:06:20 +02:00
check.sh	L3: Theorem 1 (inclusion completeness) kernel-checked	2026-07-11 12:06:20 +02:00
lean-guard	L1+L2: hashing shapes, domain separation, MTH/Root/ConsRec with termination	2026-07-10 23:58:00 +02:00