Nuprl - Pf normalization_lemma 1 1 1 2 1 1 1

PrintForm Definitions normalization Sections ClassicalProps(jlc) Doc

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

L:Sequent List. sL.((s) = 0) & (sL.|= s |= < hyp,M @ (f.N) > ) & (a:Assignment. sL.a | s a | < hyp,M @ (f.N) > )

By: FormulaCases -4

Generated subgoals:

1 7. x: Var
8. (x) > 0
9. concl = (M @ (x.N))
10. S:Sequent. (S) < ( < hyp,M @ (x.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.|= s |= S ) & (a:Assignment. sL.a | s a | S))
L:Sequent List. sL.((s) = 0) & (sL.|= s |= < hyp,M @ (x.N) > ) & (a:Assignment. sL.a | s a | < hyp,M @ (x.N) > )

2 7. x: Formula
8. (x) > 0
9. concl = (M @ (x.N))
10. S:Sequent. (S) < ( < hyp,M @ (x.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.|= s |= S ) & (a:Assignment. sL.a | s a | S))
L:Sequent List. sL.((s) = 0) & (sL.|= s |= < hyp,M @ (x.N) > ) & (a:Assignment. sL.a | s a | < hyp,M @ (x.N) > )

3 7. x1: Formula
8. x2: Formula
9. (x1x2) > 0
10. concl = (M @ (x1x2.N))
11. S:Sequent. (S) < ( < hyp,M @ (x1x2.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.|= s |= S ) & (a:Assignment. sL.a | s a | S))
L:Sequent List. sL.((s) = 0) & (sL.|= s |= < hyp,M @ (x1x2.N) > ) & (a:Assignment. sL.a | s a | < hyp,M @ (x1x2.N) > )

4 7. x1: Formula
8. x2: Formula
9. (x1x2) > 0
10. concl = (M @ (x1x2.N))
11. S:Sequent. (S) < ( < hyp,M @ (x1x2.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.|= s |= S ) & (a:Assignment. sL.a | s a | S))
L:Sequent List. sL.((s) = 0) & (sL.|= s |= < hyp,M @ (x1x2.N) > ) & (a:Assignment. sL.a | s a | < hyp,M @ (x1x2.N) > )

5 7. y1: Formula
8. y2: Formula
9. (y1y2) > 0
10. concl = (M @ (y1y2.N))
11. S:Sequent. (S) < ( < hyp,M @ (y1y2.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.|= s |= S ) & (a:Assignment. sL.a | s a | S))
L:Sequent List. sL.((s) = 0) & (sL.|= s |= < hyp,M @ (y1y2.N) > ) & (a:Assignment. sL.a | s a | < hyp,M @ (y1y2.N) > )

About:

1	7. `x:` `Var` 8. `(x) > 0` 9. `concl = (M @ (x.N))` 10. `S:Sequent. (S) < ( < hyp,M @ (x.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= S ) & (a:Assignment. sL.a \| s a \| S))` `L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= < hyp,M @ (x.N) > ) & (a:Assignment. sL.a \| s a \| < hyp,M @ (x.N) > )`
2	7. `x:` `Formula` 8. `(x) > 0` 9. `concl = (M @ (x.N))` 10. `S:Sequent. (S) < ( < hyp,M @ (x.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= S ) & (a:Assignment. sL.a \| s a \| S))` `L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= < hyp,M @ (x.N) > ) & (a:Assignment. sL.a \| s a \| < hyp,M @ (x.N) > )`
3	7. `x1:` `Formula` 8. `x2:` `Formula` 9. `(x1x2) > 0` 10. `concl = (M @ (x1x2.N))` 11. `S:Sequent. (S) < ( < hyp,M @ (x1x2.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= S ) & (a:Assignment. sL.a \| s a \| S))` `L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= < hyp,M @ (x1x2.N) > ) & (a:Assignment. sL.a \| s a \| < hyp,M @ (x1x2.N) > )`
4	7. `x1:` `Formula` 8. `x2:` `Formula` 9. `(x1x2) > 0` 10. `concl = (M @ (x1x2.N))` 11. `S:Sequent. (S) < ( < hyp,M @ (x1x2.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= S ) & (a:Assignment. sL.a \| s a \| S))` `L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= < hyp,M @ (x1x2.N) > ) & (a:Assignment. sL.a \| s a \| < hyp,M @ (x1x2.N) > )`
5	7. `y1:` `Formula` 8. `y2:` `Formula` 9. `(y1y2) > 0` 10. `concl = (M @ (y1y2.N))` 11. `S:Sequent. (S) < ( < hyp,M @ (y1y2.N) > ) (L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= S ) & (a:Assignment. sL.a \| s a \| S))` `L:Sequent List. sL.((s) = 0) & (sL.\|= s \|= < hyp,M @ (y1y2.N) > ) & (a:Assignment. sL.a \| s a \| < hyp,M @ (y1y2.N) > )`