yiyunliu/sp-eta-postpone
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Prove the fundamental theorem

Browse source
This commit is contained in:
Yiyun Liu 2025-02-06 18:09:19 -05:00
parent 399c97fa82
commit 6daa275ac8
2 changed files with 17 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

6
theories/typing.v
View file

@ -114,3 +114,9 @@ with Wff : forall {n}, (fin n -> PTm n) -> Prop :=
where
"Γ ⊢ a ∈ A" := (Wt Γ a A) and "⊢ Γ" := (Wff Γ) and "Γ ⊢ a ≡ b ∈ A" := (Eq Γ a b A).
Scheme wf_ind := Induction for Wff Sort Prop
with wt_ind := Induction for Wt Sort Prop
with eq_ind := Induction for Eq Sort Prop.
Combined Scheme wt_mutual from wf_ind, wt_ind, eq_ind.