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 "basic_2/rt_computation/fpbs_fqup.ma".
16 include "basic_2/rt_computation/fpbg.ma".
18 (* PROPER PARALLEL RST-COMPUTATION FOR CLOSURES *****************************)
20 (* Advanced properties with sort-irrelevant equivalence for terms ***********)
22 lemma fpbg_tdeq_div: ∀h,G1,G2,L1,L2,T1,T. ⦃G1, L1, T1⦄ >[h] ⦃G2, L2, T⦄ →
23 ∀T2. T2 ≛ T → ⦃G1, L1, T1⦄ >[h] ⦃G2, L2, T2⦄.
24 /4 width=5 by fpbg_fdeq_trans, tdeq_fdeq, tdeq_sym/ qed-.
26 (* Properties with plus-iterated structural successor for closures **********)
28 (* Note: this is used in the closure proof *)
29 lemma fqup_fpbg: ∀h,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ⊐+ ⦃G2, L2, T2⦄ → ⦃G1, L1, T1⦄ >[h] ⦃G2, L2, T2⦄.
30 #h #G1 #G2 #L1 #L2 #T1 #T2 #H elim (fqup_inv_step_sn … H) -H
31 /3 width=5 by fqus_fpbs, fpb_fqu, ex2_3_intro/