Built with Alectryon, running Coq+SerAPI. Bubbles () indicate interactive fragments: hover for details, tap to reveal contents. Use Ctrl+↑ Ctrl+↓ to navigate, Ctrl+🖱️ to focus. On Mac, use instead of Ctrl.
(** * Minification

This file ensures that minification works with plain Coq files (the
``minification.rst`` recipe uses the Docutils pipeline.

To run it::

    alectryon --frontend coq --html-minification minification.v
      # Plain Coq → HTML (minified); produces ‘minification.v.html’ **)

Require Import Arith.

Section Redundant.
  Context (non_negative := le_0_n).

  Fixpoint tree (n: nat) :=
    match n with
    | 0 => forall m: nat, m >= 0
    | S n => tree n /\ tree n
    end.

  
non_negative:= Nat.le_0_l: forall n : nat, 0 <= n

tree 4
3
tree 0
39
bbbbbbbbbbbbbb
3
forall m : nat, m >= 0
3f
1111111111111111111111111111
4
m: nat

m >= 0
1517
1919191919191919191919191919
13
14
apply non_negative.
14
1919191919191919191919191919
1b apply non_negative.
14
19191919191919191919191919
1b apply non_negative.
14
191919191919191919191919
1b apply non_negative.
14
1919191919191919191919
1b apply non_negative.
14
19191919191919191919
1b apply non_negative.
14
191919191919191919
1b apply non_negative.
14
1919191919191919
1b apply non_negative.
14
19191919191919
1b apply non_negative.
14
191919191919
1b apply non_negative.
14
1919191919
1b apply non_negative.
14
19191919
1b apply non_negative.
14
191919
1b apply non_negative.
14
1919
1b apply non_negative.
14
19
1b apply non_negative.
1c
1b apply non_negative. } Qed. End Redundant.