Nuprl Lemma : PZF-Formula_wf
∀[C:Type]. (PZF-Formula(C) ∈ Type)
Proof
Definitions occuring in Statement :
PZF-Formula: PZF-Formula(C),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
PZF-Formula: PZF-Formula(C),
PZF-Form: PZF-Form(C),
prop: ℙ
Lemmas referenced :
PZF-Form_wf,
not_wf,
assert_wf,
termForm_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
setEquality,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
hypothesis,
setElimination,
rename,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[C:Type]. (PZF-Formula(C) \mmember{} Type)
Date html generated:
2018_05_21-PM-11_37_13
Last ObjectModification:
2017_10_12-PM-02_58_32
Theory : PZF
Home
Index