This file tests various combinations of display flags. To compile:
alectryon display-flags.rst # reST → HTML; produces ‘display-flags.html’
∀ n : nat, 2 * nsum n (λ x : nat, x) = n * (n + 1)∀ n : nat, 2 * nsum n (λ x : nat, x) = n * (n + 1)2 * 0 = 0 * (0 + 1)n: nat
IHn: 2 * nsum n (λ x : nat, x) = n * (n + 1)2 * (S n + nsum n (λ x : nat, x)) = S n * (S n + 1)2 * 0 = 0 * (0 + 1)reflexivity.2 * 0 = 0 * (0 + 1)n: nat
IHn: 2 * nsum n (λ x : nat, x) = n * (n + 1)2 * (S n + nsum n (λ x : nat, x)) = S n * (S n + 1)2 * S n + 2 * nsum n (λ x : nat, x) = S n * (S n + 1)2 * S n + n * (n + 1) = S n * (S n + 1)ring. Qed.
Definition xyz := 123.
(* Visible *)
TrueQed.
Permutation l l' → List.In a l → List.In a l'H: Permutation l l'
IHPermutation: List.In a l → List.In a l'
Hin: List.In a (x :: l)
ggList.In a (x :: l')l, l', l'': list A
H: Permutation l l'
H0: Permutation l' l''
IHPermutation1: List.In a l → List.In a l'
IHPermutation2: List.In a l' → List.In a l''
Hin: List.In a lList.In a l''all: tauto. Qed.Hin: FalseH: Permutation l l'
IHPermutation: List.In a l → List.In a l'
Hin: x = a ∨ List.In a lHin: y = a ∨ x = a ∨ List.In a lH: Permutation l l'
H0: Permutation l' l''
IHPermutation1: List.In a l → List.In a l'
IHPermutation2: List.In a l' → List.In a l''
Hin: List.In a l