1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
17 (* NORMAL PROOF TREE TRACKS
20 include "Insert/defs.ma".
22 inductive NTrack: Context \to Proof \to Sequent \to Prop \def
23 | ntrack_proj: \forall P,Q,S,i. Insert S i P Q \to NTrack Q (lref i) S
24 | ntrack_posr: \forall P,h.
25 NTrack P (parx h) (pair (posr h) (posr h))
26 | ntrack_impw: \forall P,r,D,a,b. NTrack P r (pair lleaf D) \to
27 NTrack P (impw r) (pair (impl a b) D)
28 | ntrack_impr: \forall P,r. \forall a,b:Formula.
29 NTrack P r (pair a b) \to
30 NTrack P (impr r) (pair lleaf (impl a b))
31 | ntrack_impi: \forall P,Q,p,q,r,A,B,D,i. \forall a,b:Formula.
32 NTrack P p (pair A a) \to
33 NTrack P q (pair b B) \to
34 NTrack Q r (pair lleaf D) \to
35 Insert (pair A B) i P Q \to
36 NTrack P (impi p q r) (pair (impl a b) D)