Nuprl Lemma : tagged_wf
∀[T:Atom ⟶ Type]. (tagged(x.T[x]) ∈ Type)
Proof
Definitions occuring in Statement :
tagged: tagged(x.T[x]),
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
atom: Atom,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
tagged: tagged(x.T[x]),
so_apply: x[s]
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
productEquality,
atomEquality,
applyEquality,
hypothesisEquality,
sqequalHypSubstitution,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
functionEquality,
cumulativity,
universeEquality
Latex:
\mforall{}[T:Atom {}\mrightarrow{} Type]. (tagged(x.T[x]) \mmember{} Type)
Date html generated:
2016_05_15-PM-06_45_33
Last ObjectModification:
2015_12_27-AM-11_48_12
Theory : general
Home
Index