PrintForm
Definitions
grammar
1
Sections
AutomataTheory
Doc
At:
g
eq
wf
V1,V2,T:Type, G1:Grammar(V1;T), G2:Grammar(V2;T). G1 = G2
Prop
By:
Unfold `g_eq` 0
THEN
Unfold `lang_eq` 0
THEN
Unfold `g_lang` 0
THEN
UnivCD
Generated subgoal:
1
1.
V1:
Type
2.
V2:
Type
3.
T:
Type
4.
G1:
Grammar(V1;T)
5.
G2:
Grammar(V2;T)
(
l:(Void+T)*. (
l.[S]
l)(l)
(
l.[S]
l)(l))
Prop
About: