Nuprl Lemma : mk_mFOLSequent_wf
∀[hyps:mFOL() List]. ∀[concl:mFOL()].  (hyps ⊢ concl ∈ mFOL-sequent())
Proof
Definitions occuring in Statement : 
mk_mFOLSequent: mk_mFOLSequent, 
mFOL-sequent: mFOL-sequent()
, 
mFOL: mFOL()
, 
list: T List
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
mk_mFOLSequent: mk_mFOLSequent, 
subtype_rel: A ⊆r B
, 
mFOL-sequent: mFOL-sequent()
Lemmas referenced : 
list_wf, 
mFOL_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
sqequalRule, 
independent_pairEquality, 
hypothesisEquality, 
hypothesis, 
applyEquality, 
thin, 
lambdaEquality, 
sqequalHypSubstitution, 
productEquality, 
lemma_by_obid, 
isectElimination, 
axiomEquality, 
equalityTransitivity, 
equalitySymmetry, 
isect_memberEquality, 
because_Cache
Latex:
\mforall{}[hyps:mFOL()  List].  \mforall{}[concl:mFOL()].    (hyps  \mvdash{}  concl  \mmember{}  mFOL-sequent())
Date html generated:
2016_05_15-PM-10_25_58
Last ObjectModification:
2015_12_27-PM-06_27_14
Theory : minimal-first-order-logic
Home
Index