Nuprl Lemma : bar-diverges_wf
∀[T:Type]. ∀[x:bar-base(T)]. (x↑ ∈ ℙ)
Proof
Definitions occuring in Statement :
bar-diverges: x↑,
bar-base: bar-base(T),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
bar-diverges: x↑,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
all_wf,
nat_wf,
not_wf,
assert_wf,
isl_wf,
unit_wf2,
bar-val_wf,
bar-base_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
lambdaEquality,
hypothesisEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[x:bar-base(T)]. (x\muparrow{} \mmember{} \mBbbP{})
Date html generated:
2016_05_14-AM-06_20_18
Last ObjectModification:
2015_12_26-PM-00_01_25
Theory : co-recursion
Home
Index