G:Sequent.
L:Sequent List.
s
L.(
(s) = 0)
& (sL.|= s 
|= G )
& (a:Assignment. sL.a |
s a | G)
normalization_lemma
a:Full(S). a |= S
Thm* G:Sequent.
L:Sequent List.
sL.((s) = 0)
& (sL.|= s |= G )
& (a:Assignment. sL.a | s a | G)
normalization_lemma
In prior sections: sequent valid elimination