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 (**************************************************************************)
15 include "static_2/s_computation/fqus_fqup.ma".
16 include "basic_2/rt_transition/fpbc_fqup.ma".
17 include "basic_2/rt_computation/fpbs_fqus.ma".
18 include "basic_2/rt_computation/fpbg_fqup.ma".
19 include "basic_2/rt_computation/fpbg_fpbs.ma".
21 (* PROPER PARALLEL RST-COMPUTATION FOR CLOSURES *****************************)
23 (* Properties with plus-iterated structural successor for closures **********)
25 (* Note: this is used in the closure proof *)
27 ∀G1,G2,L1,L2,T1,T2. ❨G1,L1,T1❩ ⬂+ ❨G2,L2,T2❩ → ❨G1,L1,T1❩ > ❨G2,L2,T2❩.
28 #G1 #G2 #L1 #L2 #T1 #T2 #H elim (fqup_inv_step_sn … H) -H
29 /3 width=5 by fpbc_fpbs_fpbg, fqus_fpbs, fqu_fpbc/
32 (* Note: this is used in the closure proof *)
33 lemma fqup_fpbg_trans (G) (L) (T):
34 ∀G1,L1,T1. ❨G1,L1,T1❩ ⬂+ ❨G,L,T❩ →
35 ∀G2,L2,T2. ❨G,L,T❩ > ❨G2,L2,T2❩ → ❨G1,L1,T1❩ > ❨G2,L2,T2❩.
36 /3 width=5 by fpbs_fpbg_trans, fqup_fpbs/ qed-.