matita/matita/contribs/lambdadelta/basic_2/rt_computation/fpbg_fqup.ma

   1 (**************************************************************************)
   2 (*       ___                                                              *)
   3 (*      ||M||                                                             *)
   4 (*      ||A||       A project by Andrea Asperti                           *)
   5 (*      ||T||                                                             *)
   6 (*      ||I||       Developers:                                           *)
   7 (*      ||T||         The HELM team.                                      *)
   8 (*      ||A||         http://helm.cs.unibo.it                             *)
   9 (*      \   /                                                             *)
  10 (*       \ /        This file is distributed under the terms of the       *)
  11 (*        v         GNU General Public License Version 2                  *)
  12 (*                                                                        *)
  13 (**************************************************************************)
  14
  15 include "basic_2/rt_computation/fpbs_fqup.ma".
  16 include "basic_2/rt_computation/fpbg.ma".
  17
  18 (* PROPER PARALLEL RST-COMPUTATION FOR CLOSURES *****************************)
  19
  20 (* Properties with plus-iterated structural successor for closures **********)
  21
  22 (* Note: this is used in the closure proof *)
  23 lemma fqup_fpbg: ∀h,o,G1,G2,L1,L2,T1,T2. ⦃G1, L1, T1⦄ ⊐+ ⦃G2, L2, T2⦄ → ⦃G1, L1, T1⦄ >[h, o] ⦃G2, L2, T2⦄.
  24 #h #o #G1 #G2 #L1 #L2 #T1 #T2 #H elim (fqup_inv_step_sn … H) -H
  25 /3 width=5 by fqus_fpbs, fpb_fqu, ex2_3_intro/
  26 qed.