Nuprl Lemma : mk_mFOLProofNode_wf
∀[T:Type]. ∀[sr:mFOL-sequent() × FOLRule()]. ∀[subgoals:T List].  (sr
                                                                   subgoals ∈ mFOL-sequent() × FOLRule() × (T List))
Proof
Definitions occuring in Statement : 
mk_mFOLProofNode: mk_mFOLProofNode, 
mFOL-sequent: mFOL-sequent()
, 
FOLRule: FOLRule()
, 
list: T List
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
product: x:A × B[x]
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
mk_mFOLProofNode: mk_mFOLProofNode
Lemmas referenced : 
list_wf, 
mFOL-sequent_wf, 
FOLRule_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
sqequalRule, 
independent_pairEquality, 
hypothesisEquality, 
sqequalHypSubstitution, 
hypothesis, 
axiomEquality, 
equalityTransitivity, 
equalitySymmetry, 
lemma_by_obid, 
isectElimination, 
thin, 
isect_memberEquality, 
because_Cache, 
productEquality, 
universeEquality
Latex:
...
Date html generated:
2016_05_15-PM-10_28_25
Last ObjectModification:
2015_12_27-PM-06_25_12
Theory : minimal-first-order-logic
Home
Index