PrintForm Definitions normalization Sections ClassicalProps(jlc) Doc

At: normalization lemma 1 1 1 2 1

1. hyp: Formula List
2. concl: Formula List
3. S:Sequent. (S) < ( < hyp,concl > ) (L:Sequent List. sL.((s) = 0) & (sL.|= s |= S ) & (a:Assignment. sL.a | s a | S))
4. fhyp.((f) > 0)
5. fconcl.((f) > 0)

L:Sequent List. sL.((s) = 0) & (sL.|= s |= < hyp,concl > ) & (a:Assignment. sL.a | s a | < hyp,concl > )

By:
Thin -2
THEN
FwdThru Thm* P:(TProp), L:T List. xL.P(x) (M,N:T List, x:T. P(x) & L = (M @ (x.N))) [-1]
THEN
Repeat (Analyze -1)


Generated subgoal:

14. fconcl.((f) > 0)
5. M: Formula List
6. N: Formula List
7. f: Formula
8. (f) > 0
9. concl = (M @ (f.N))
L:Sequent List. sL.((s) = 0) & (sL.|= s |= < hyp,concl > ) & (a:Assignment. sL.a | s a | < hyp,concl > )


About:
existslistandequalintapply
natural_numberimpliespairallless_than