(* *)
(**************************************************************************)
+include "basic_2/rt_transition/fpbc_lpx.ma".
include "basic_2/rt_computation/fpbs_lpxs.ma".
-include "basic_2/rt_computation/fpbg.ma".
+include "basic_2/rt_computation/fpbg_fqup.ma".
(* PROPER PARALLEL RST-COMPUTATION FOR CLOSURES *****************************)
(* Basic_2A1: uses: lpxs_fpbg *)
lemma lpxs_rneqx_fpbg:
∀G,L1,L2,T. ❪G,L1❫ ⊢ ⬈* L2 →
- (L1 â\89\9b[T] L2 → ⊥) → ❪G,L1,T❫ > ❪G,L2,T❫.
+ (L1 â\89\85[T] L2 → ⊥) → ❪G,L1,T❫ > ❪G,L2,T❫.
#G #L1 #L2 #T #H #H0
-elim (lpxs_rneqx_inv_step_sn … H … H0) -H -H0
-/4 width=7 by fpb_lpx, lpxs_feqx_fpbs, feqx_intro_sn, ex2_3_intro/
+elim (lpxs_rneqg_inv_step_sn … H … H0) -H -H0
+/4 width=10 by fpbc_fpbs_fpbg, lpxs_feqg_fpbs, lpx_fpbc, feqg_intro_sn, sfull_dec/
qed.