Description: Lemma for efgrelex . Show that L is an equivalence relation containing all direct extensions of a word, so is closed under .~ . (Contributed by Mario Carneiro, 1-Oct-2015)
Ref | Expression | ||
---|---|---|---|
Hypotheses | efgval.w | |
|
efgval.r | |
||
efgval2.m | |
||
efgval2.t | |
||
efgred.d | |
||
efgred.s | |
||
efgcpbllem.1 | |
||
Assertion | efgcpbllemb | |