L:Sequent List, eqS:{Sequent=
}, eqF:{Formula=}.
s
L.(
(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
formula)+(formulaformula)+(formulaformula))
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: formula valuation formula satisfaction formula falsification formula rank formula equality sat lemmas full assignment formula validity sequent formula list sequent rank sequent valid elimination