(**************************************************************************)
include "basic_2/notation/relations/btsn_5.ma".
-include "basic_2/reduction/fpbc.ma".
+include "basic_2/reduction/fpb.ma".
include "basic_2/computation/csx.ma".
-(* "BIG TREE" STRONGLY NORMALIZING TERMS ************************************)
+(* "QRST" STRONGLY NORMALIZING TERMS ****************************************)
inductive fsb (h) (g): relation3 genv lenv term ≝
| fsb_intro: ∀G1,L1,T1. (
.
interpretation
- "'big tree' strong normalization (closure)"
+ "'qrst' strong normalization (closure)"
'BTSN h g G L T = (fsb h g G L T).
(* Basic eliminators ********************************************************)
(* Basic inversion lemmas ***************************************************)
lemma fsb_inv_csx: ∀h,g,G,L,T. ⦃G, L⦄ ⊢ ⦥[h, g] T → ⦃G, L⦄ ⊢ ⬊*[h, g] T.
-#h #g #G #L #T #H elim H -G -L -T /5 width=1 by csx_intro, fpbc_cpx/
+#h #g #G #L #T #H elim H -G -L -T /5 width=1 by csx_intro, fpb_cpx/
qed-.