(* CONTEXT-FREE REDUCIBLE AND IRREDUCIBLE TERMS *****************************)
(* reducible terms *)
-inductive trf: term → Prop ≝
+inductive trf: predicate term ≝
| trf_abst_sn: ∀V,T. trf V → trf (𝕔{Abst} V. T)
| trf_abst_dx: ∀V,T. trf T → trf (𝕔{Abst} V. T)
| trf_appl_sn: ∀V,T. trf V → trf (𝕔{Appl} V. T)
'Reducible T = (trf T).
(* irreducible terms *)
-definition tif: term → Prop ≝
- λT. ℝ[T] → False.
+definition tif: predicate term ≝ λT. ℝ[T] → False.
interpretation
"context-free irreducibility (term)"