(* Inversion lemmas with context-free sort-irrelevant equivalence for terms *)
-fact fqu_inv_teqx_aux: â\88\80b,G1,G2,L1,L2,T1,T2. â¦\83G1,L1,T1â¦\84 â¬\82[b] â¦\83G2,L2,T2â¦\84 →
+fact fqu_inv_teqx_aux: â\88\80b,G1,G2,L1,L2,T1,T2. â\9dªG1,L1,T1â\9d« â¬\82[b] â\9dªG2,L2,T2â\9d« →
G1 = G2 → |L1| = |L2| → T1 ≛ T2 → ⊥.
#b #G1 #G2 #L1 #L2 #T1 #T2 * -G1 -G2 -L1 -L2 -T1 -T2
[1: #I #G #L #V #_ #H elim (succ_inv_refl_sn … H)
qed-.
(* Basic_2A1: uses: fqu_inv_eq *)
-lemma fqu_inv_teqx: â\88\80b,G,L1,L2,T1,T2. â¦\83G,L1,T1â¦\84 â¬\82[b] â¦\83G,L2,T2â¦\84 →
+lemma fqu_inv_teqx: â\88\80b,G,L1,L2,T1,T2. â\9dªG,L1,T1â\9d« â¬\82[b] â\9dªG,L2,T2â\9d« →
|L1| = |L2| → T1 ≛ T2 → ⊥.
#b #G #L1 #L2 #T1 #T2 #H
@(fqu_inv_teqx_aux … H) // (**) (* full auto fails *)
-qed-.
+qed-.