L:Sequent List.
s
L.(
(s) = 0) 
sL.|= s 
(
a:Assignment. sL.a |
s)
zero_rank_valid_or_falsifiable
xL.P(x)
== (letrec list_all L = (Case of L; nil 
True ; h.t P(h) & list_all(t)) ) (L)
Thm* L:Sequent List.
sL.((s) = 0)
sL.|= s (a:Assignment. sL.a | s)
zero_rank_valid_or_falsifiable
Thm* L:Sequent List, eqS:{Sequent=
}, eqF:{Formula=}.
sL.((s) = 0)
(hyp,concl:Formula List.
< hyp,concl > (eqS) L
(z:Formula. z(eqF) hyp z(eqF) concl (v:Var. z = 
v
)))
zero_rank_all_vars
In prior sections: list 3 jlc normalization