Nuprl Lemma : bm_compare_refl_le
∀[K:Type]. ∀[compare:bm_compare(K)]. ∀[k:K]. (0 ≤ (compare k k))
Proof
Definitions occuring in Statement :
bm_compare: bm_compare(K),
uall: ∀[x:A]. B[x],
le: A ≤ B,
apply: f a,
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
le: A ≤ B,
and: P ∧ Q,
not: ¬A,
implies: P ⇒ Q,
false: False,
bm_compare: bm_compare(K),
prop: ℙ,
or: P ∨ Q,
all: ∀x:A. B[x]
Latex:
\mforall{}[K:Type]. \mforall{}[compare:bm\_compare(K)]. \mforall{}[k:K]. (0 \mleq{} (compare k k))
Date html generated:
2016_05_17-PM-01_40_47
Last ObjectModification:
2015_12_28-PM-08_08_58
Theory : binary-map
Home
Index