Nuprl Lemma : mk_mFOLSequentRule_wf
∀[s:mFOL-sequent()]. ∀[r:FOLRule()]. (s BY r ∈ mFOL-sequent() × FOLRule())
Proof
Definitions occuring in Statement :
mk_mFOLSequentRule: mk_mFOLSequentRule,
mFOL-sequent: mFOL-sequent(),
FOLRule: FOLRule(),
uall: ∀[x:A]. B[x],
member: t ∈ T,
product: x:A × B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
mk_mFOLSequentRule: mk_mFOLSequentRule
Lemmas referenced :
FOLRule_wf,
mFOL-sequent_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,
isect_memberEquality,
isectElimination,
thin,
because_Cache
Latex:
\mforall{}[s:mFOL-sequent()]. \mforall{}[r:FOLRule()]. (s BY r \mmember{} mFOL-sequent() \mtimes{} FOLRule())
Date html generated:
2016_05_15-PM-10_28_18
Last ObjectModification:
2015_12_27-PM-06_25_05
Theory : minimal-first-order-logic
Home
Index