Nuprl Lemma : FOStruct+_wf
∀[Dom:Type]. (FOStruct+{i:l}(Dom) ∈ 𝕌')
Proof
Definitions occuring in Statement :
FOStruct+: FOStruct+{i:l}(Dom),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
FOStruct+: FOStruct+{i:l}(Dom),
FOStruct: FOStruct(Dom),
subtype_rel: A ⊆r B,
prop: ℙ
Lemmas referenced :
FOStruct_wf,
exception-type_wf,
nil_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
setEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
cumulativity,
applyEquality,
tokenEquality,
lambdaEquality,
universeEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[Dom:Type]. (FOStruct+\{i:l\}(Dom) \mmember{} \mBbbU{}')
Date html generated:
2016_05_15-PM-10_12_02
Last ObjectModification:
2015_12_27-PM-06_33_56
Theory : minimal-first-order-logic
Home
Index