inductive aaa: relation4 genv lenv term aarity ≝
| aaa_sort: ∀G,L,s. aaa G L (⋆s) (⓪)
| aaa_zero: ∀I,G,L,V,B. aaa G L V B → aaa G (L.ⓑ{I}V) (#0) B
-| aaa_lref: â\88\80I,G,L,A,i. aaa G L (#i) A â\86\92 aaa G (L.â\93\98{I}) (#⫯i) A
+| aaa_lref: â\88\80I,G,L,A,i. aaa G L (#i) A â\86\92 aaa G (L.â\93\98{I}) (#â\86\91i) A
| aaa_abbr: ∀p,G,L,V,T,B,A.
aaa G L V B → aaa G (L.ⓓV) T A → aaa G L (ⓓ{p}V.T) A
| aaa_abst: ∀p,G,L,V,T,B,A.
∃∃I,K,V. L = K.ⓑ{I}V & ⦃G, K⦄ ⊢ V ⁝ A.
/2 width=3 by aaa_inv_zero_aux/ qed-.
-fact aaa_inv_lref_aux: â\88\80G,L,T,A. â¦\83G, Lâ¦\84 â\8a¢ T â\81\9d A â\86\92 â\88\80i. T = #(⫯i) →
+fact aaa_inv_lref_aux: â\88\80G,L,T,A. â¦\83G, Lâ¦\84 â\8a¢ T â\81\9d A â\86\92 â\88\80i. T = #(â\86\91i) →
∃∃I,K. L = K.ⓘ{I} & ⦃G, K⦄ ⊢ #i ⁝ A.
#G #L #T #A * -G -L -T -A
[ #G #L #s #j #H destruct
]
qed-.
-lemma aaa_inv_lref: â\88\80G,L,A,i. â¦\83G, Lâ¦\84 â\8a¢ #⫯i ⁝ A →
+lemma aaa_inv_lref: â\88\80G,L,A,i. â¦\83G, Lâ¦\84 â\8a¢ #â\86\91i ⁝ A →
∃∃I,K. L = K.ⓘ{I} & ⦃G, K⦄ ⊢ #i ⁝ A.
/2 width=3 by aaa_inv_lref_aux/ qed-.