(* Basic_2A1: uses by definition nta_appl ntaa_appl *)
lemma nta_appl_abst (h) (a) (p) (G) (L):
∀n. ad a n →
- â\88\80V,W. â\9dªG,Lâ\9d« ⊢ V :[h,a] W →
- â\88\80T,U. â\9dªG,L.â\93\9bWâ\9d« â\8a¢ T :[h,a] U â\86\92 â\9dªG,Lâ\9d« ⊢ ⓐV.ⓛ[p]W.T :[h,a] ⓐV.ⓛ[p]W.U.
+ â\88\80V,W. â\9d¨G,Lâ\9d© ⊢ V :[h,a] W →
+ â\88\80T,U. â\9d¨G,L.â\93\9bWâ\9d© â\8a¢ T :[h,a] U â\86\92 â\9d¨G,Lâ\9d© ⊢ ⓐV.ⓛ[p]W.T :[h,a] ⓐV.ⓛ[p]W.U.
#h #a #p #G #L #n #Ha #V #W #H1 #T #U #H2
elim (cnv_inv_cast … H1) -H1 #X1 #HW #HV #HWX1 #HVX1
elim (cnv_inv_cast … H2) -H2 #X2 #HU #HT #HUX2 #HTX2
(* Basic_2A1: was nta_appl_old *)
lemma nta_appl (h) (a) (p) (G) (L):
∀n. 1 ≤ n → ad a n →
- â\88\80V,W. â\9dªG,Lâ\9d« ⊢ V :[h,a] W →
- â\88\80T,U. â\9dªG,Lâ\9d« â\8a¢ T :[h,a] â\93\9b[p]W.U â\86\92 â\9dªG,Lâ\9d« ⊢ ⓐV.T :[h,a] ⓐV.ⓛ[p]W.U.
+ â\88\80V,W. â\9d¨G,Lâ\9d© ⊢ V :[h,a] W →
+ â\88\80T,U. â\9d¨G,Lâ\9d© â\8a¢ T :[h,a] â\93\9b[p]W.U â\86\92 â\9d¨G,Lâ\9d© ⊢ ⓐV.T :[h,a] ⓐV.ⓛ[p]W.U.
#h #a #p #G #L #n #Hn #Ha #V #W #H1 #T #U #H2
elim (cnv_inv_cast … H1) -H1 #X1 #HW #HV #HWX1 #HVX1
elim (cnv_inv_cast … H2) -H2 #X2 #HU #HT #HUX2 #HTX2
(* Inversion lemmas with advanced rt_computation for terms ******************)
lemma nta_inv_abst_bi_cnv (h) (a) (p) (G) (K) (W):
- â\88\80T,U. â\9dªG,Kâ\9d« ⊢ ⓛ[p]W.T :[h,a] ⓛ[p]W.U →
- â\88§â\88§ â\9dªG,Kâ\9d« â\8a¢ W ![h,a] & â\9dªG,K.â\93\9bWâ\9d« ⊢ T :[h,a] U.
+ â\88\80T,U. â\9d¨G,Kâ\9d© ⊢ ⓛ[p]W.T :[h,a] ⓛ[p]W.U →
+ â\88§â\88§ â\9d¨G,Kâ\9d© â\8a¢ W ![h,a] & â\9d¨G,K.â\93\9bWâ\9d© ⊢ T :[h,a] U.
#h #a #p #G #K #W #T #U #H
elim (cnv_inv_cast … H) -H #X #HWU #HWT #HUX #HTX
elim (cnv_inv_bind … HWU) -HWU #HW #HU