(* Basic_2A1: uses: lleq_lpxs_trans *)
lemma reqg_lpxs_trans (S) (G) (T:term):
reflexive … S → symmetric … S →
- â\88\80L2,K2. â\9dªG,L2â\9d« ⊢ ⬈* K2 → ∀L1. L1 ≛[S,T] L2 →
- â\88\83â\88\83K1. â\9dªG,L1â\9d« ⊢ ⬈* K1 & K1 ≛[S,T] K2.
+ â\88\80L2,K2. â\9d¨G,L2â\9d© ⊢ ⬈* K2 → ∀L1. L1 ≛[S,T] L2 →
+ â\88\83â\88\83K1. â\9d¨G,L1â\9d© ⊢ ⬈* K1 & K1 ≛[S,T] K2.
#S #G #T #H1S #H2S #L2 #K2 #H @(lpxs_ind_sn … H) -L2 /2 width=3 by ex2_intro/
#L #L2 #HL2 #_ #IH #L1 #HT
elim (reqg_lpx_trans … HL2 … HT) // -L #L #HL1 #HT
lemma lpxs_rneqg_inv_step_sn (S) (G) (T:term):
reflexive … S → symmetric … S → Transitive … S →
(∀s1,s2. Decidable (S s1 s2)) →
- â\88\80L1,L2. â\9dªG,L1â\9d« ⊢ ⬈* L2 → (L1 ≛[S,T] L2 → ⊥) →
- â\88\83â\88\83L,L0. â\9dªG,L1â\9d« â\8a¢ â¬\88 L & L1 â\89\9b[S,T] L â\86\92 â\8a¥ & â\9dªG,Lâ\9d« ⊢ ⬈* L0 & L0 ≛[S,T] L2.
+ â\88\80L1,L2. â\9d¨G,L1â\9d© ⊢ ⬈* L2 → (L1 ≛[S,T] L2 → ⊥) →
+ â\88\83â\88\83L,L0. â\9d¨G,L1â\9d© â\8a¢ â¬\88 L & L1 â\89\9b[S,T] L â\86\92 â\8a¥ & â\9d¨G,Lâ\9d© ⊢ ⬈* L0 & L0 ≛[S,T] L2.
#S #G #T #H1S #H2S #H3S #H4S #L1 #L2 #H @(lpxs_ind_sn … H) -L1
[ #H elim H -H /2 width=1 by reqg_refl/
| #L1 #L #H1 #H2 #IH2 #H12 elim (reqg_dec S … L1 L T) // #H