Nuprl Lemma : bm_compare_refl_eq
∀[K:Type]. ∀[compare:bm_compare(K)]. ∀[k:K]. ((compare k k) = 0 ∈ ℤ)
Proof
Definitions occuring in Statement :
bm_compare: bm_compare(K),
uall: ∀[x:A]. B[x],
apply: f a,
natural_number: $n,
int: ℤ,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
bm_compare: bm_compare(K),
and: P ∧ Q,
guard: {T},
refl: Refl(T;x,y.E[x; y]),
all: ∀x:A. B[x]
Latex:
\mforall{}[K:Type]. \mforall{}[compare:bm\_compare(K)]. \mforall{}[k:K]. ((compare k k) = 0)
Date html generated:
2016_05_17-PM-01_40_50
Last ObjectModification:
2015_12_28-PM-08_08_53
Theory : binary-map
Home
Index