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 @ (q
r.N),concl >
By:
Rewrite (UnfoldC `sequent_falsifiable` THENC AbReduceC THENC HigherC (LemmaC
Thm*
P:(T
Prop), L,M:T List.
x
(L @ M).P(x)
x
L.P(x) &
x
M.P(x)) THENC AbReduceC THENC HigherC (LemmaC
Thm*
a:Assignment, q,r:Formula. a |= q
r
a |= q & a |= r )) 0
Generated subgoal:
1
a |= q & a |= r &
F
M.a |= F &
F
N.a |= F &
F
concl.a |
F
F
M.a |= F & a |= q & a |= r &
F
N.a |= F &
F
concl.a |
F
About: