(* TERMS ********************************************************************)
-let rec applv Vs T on Vs ≝
+rec definition applv Vs T on Vs ≝
match Vs with
[ nil ⇒ T
| cons hd tl ⇒ ⓐhd. (applv tl T)
interpretation "application to vector (term)"
'SnApplVector Vs T = (applv Vs T).
-(* properties concerning simple terms ***************************************)
+(* Basic properties *********************************************************)
-lemma applv_simple: ∀T,Vs. 𝐒⦃T⦄ → 𝐒⦃ⒶVs.T⦄.
+lemma applv_nil: ∀T. Ⓐ◊.T = T.
+// qed.
+
+lemma applv_cons: ∀V,Vs,T. ⒶV@Vs.T = ⓐV.ⒶVs.T.
+// qed.
+
+(* Properties with simple terms *********************************************)
+
+lemma applv_simple: ∀T,Vs. 𝐒⦃T⦄ → 𝐒⦃ⒶVs.T⦄.
#T * //
qed.