PrintForm Definitions elimination Sections ClassicalProps(jlc) Doc

At: formula and left falsifiable 1

1. concl: Formula List
2. M: Formula List
3. N: Formula List
4. q: Formula
5. r: Formula
6. a: Assignment

a | < [q; r/ M @ N],concl > a | < M @ (qr.N),concl >

By: Rewrite (UnfoldC `sequent_falsifiable` THENC AbReduceC THENC HigherC (LemmaC Thm* P:(TProp), L,M:T List. x(L @ M).P(x) xL.P(x) & xM.P(x)) THENC AbReduceC THENC HigherC (LemmaC Thm* a:Assignment, q,r:Formula. a |= qr a |= q & a |= r )) 0

Generated subgoal:

1 a |= q & a |= r & FM.a |= F & FN.a |= F & Fconcl.a | F FM.a |= F & a |= q & a |= r & FN.a |= F & Fconcl.a | F


About:
pairconslistand