Nuprl Lemma : prec-label_wf
∀[P:Type]. ∀[a:Atom ⟶ P ⟶ ((P + P + Type) List)]. ∀[i:P]. ∀[x:prec(lbl,p.a[lbl;p];i)].
(prec-label(x) ∈ {lbl:Atom| 0 < ||a[lbl;i]||} )
Proof
Definitions occuring in Statement :
prec-label: prec-label(x),
prec: prec(lbl,p.a[lbl; p];i),
length: ||as||,
list: T List,
less_than: a < b,
uall: ∀[x:A]. B[x],
so_apply: x[s1;s2],
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
union: left + right,
natural_number: $n,
atom: Atom,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
dest-prec: dest-prec(x),
prec-label: prec-label(x),
so_apply: x[s1;s2],
prop: ℙ,
so_lambda: λ2x.t[x],
so_lambda: λ2x y.t[x; y],
so_apply: x[s]
Lemmas referenced :
dest-prec_wf,
pi1_wf,
less_than_wf,
length_wf,
tuple-type_wf,
prec-arg-types_wf,
istype-atom,
istype-less_than,
prec_wf,
list_wf,
istype-universe
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
hypothesis,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
sqequalRule,
setEquality,
atomEquality,
natural_numberEquality,
instantiate,
unionEquality,
cumulativity,
universeEquality,
applyEquality,
Error :lambdaEquality_alt,
Error :inhabitedIsType,
setElimination,
rename,
Error :setIsType,
Error :universeIsType,
Error :functionIsType
Latex:
\mforall{}[P:Type]. \mforall{}[a:Atom {}\mrightarrow{} P {}\mrightarrow{} ((P + P + Type) List)]. \mforall{}[i:P]. \mforall{}[x:prec(lbl,p.a[lbl;p];i)].
(prec-label(x) \mmember{} \{lbl:Atom| 0 < ||a[lbl;i]||\} )
Date html generated:
2019_06_20-PM-02_05_23
Last ObjectModification:
2019_02_28-PM-02_43_58
Theory : tuples
Home
Index