Nuprl Lemma : ordered_bs_tree_wf
∀[E:Type]. ∀[cmp:comparison(E)]. (ordered_bs_tree(E;cmp) ∈ Type)
Proof
Definitions occuring in Statement :
ordered_bs_tree: ordered_bs_tree(E;cmp),
comparison: comparison(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
ordered_bs_tree: ordered_bs_tree(E;cmp),
prop: ℙ,
all: ∀x:A. B[x]
Lemmas referenced :
comparison_wf,
bs_tree_ordered_wf,
bs_tree_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
setEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
dependent_functionElimination,
isect_memberEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[E:Type]. \mforall{}[cmp:comparison(E)]. (ordered\_bs\_tree(E;cmp) \mmember{} Type)
Date html generated:
2016_05_15-PM-01_51_14
Last ObjectModification:
2016_04_07-PM-07_03_33
Theory : tree_1
Home
Index