Nuprl Lemma : AbstractFOFormula_wf
∀[vs:ℤ List]. (AbstractFOFormula(vs) ∈ 𝕌')
Proof
Definitions occuring in Statement :
AbstractFOFormula: AbstractFOFormula(vs),
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
AbstractFOFormula: AbstractFOFormula(vs),
prop: ℙ
Lemmas referenced :
FOStruct_wf,
FOAssignment_wf,
list_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
functionEquality,
universeEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
cumulativity,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
intEquality
Latex:
\mforall{}[vs:\mBbbZ{} List]. (AbstractFOFormula(vs) \mmember{} \mBbbU{}')
Date html generated:
2016_05_15-PM-10_12_08
Last ObjectModification:
2015_12_27-PM-06_33_54
Theory : minimal-first-order-logic
Home
Index