Version: v0.14.0

The Typst printer writes only Typst tokens, in lexable order

Lean module Esm.Document.Math.TokTypst, formal/Esm/Document/Math/TokTypst.lean at ffd5aee2f868
Imports Esm.Document.Math.LexTypst, Esm.Document.Math.TokLatex

Every token of a printed well-formed expression is a Typst token (tokOK ), every call parenthesis follows a name-like token, and no unit block follows a unit block (Adj ), so the Typst lexer lemma applies to the printer’s output.

def Nice (ts : List Tok) : Prop

A list that may follow anything: it does not start with a call parenthesis or a unit block.

theorem good_times proved source
theorem good_times {B : List Tok} (hB : Good (.kw .lbk :: B)) : Good (.kw .times :: .kw .lbk :: B)

times and the bracket after it.

macro source
macro "gok" : tactic

Close Good, Nice and fact goals about a printed template from the pieces in the context.

Names

Printer pieces

macro source
macro "fixed" : tactic

The fixed tokens of a printed template.

Reductions

theorem good_close proved source
theorem good_close {A : List Tok} {k : Kw} (hk : kwOK k = true) (hl : k ≠ .lp) (hA : Good A) (hn : Nice A) :
    Good (A ++ [.kw k]) ∧ Nice (A ++ [.kw k])

The list toks ++ [closer] for a list that is good and nice.

Block assembly

The induction

theorem print_ok proved source
theorem print_ok (S : Sym) (e : Json) (he : isE e = true) :
    (∀ t ∈ print .typst S e, tokOK t ∨ t = .kw .times) ∧ Adj (print .typst S e) ∧
      ∀ r, print .typst S e ≠ .kw .lp :: r

Every token the Typst printer writes for a well-formed expression is a Typst token, in an order the Typst lexer reads back.

This module also proves 52 lemmas without doc comments; they are in the source.