Nuprl Lemma : bm_compare_connex_le
∀[K:Type]. ∀compare:bm_compare(K). ∀k1,k2:K. ((0 ≤ (compare k1 k2)) ∨ (0 ≤ (compare k2 k1)))
Proof
Definitions occuring in Statement :
bm_compare: bm_compare(K),
uall: ∀[x:A]. B[x],
le: A ≤ B,
all: ∀x:A. B[x],
or: P ∨ Q,
apply: f a,
natural_number: $n,
universe: Type
Lemmas :
decidable__le,
le_wf,
zero-le-nat,
bm_compare_wf
\mforall{}[K:Type]. \mforall{}compare:bm\_compare(K). \mforall{}k1,k2:K. ((0 \mleq{} (compare k1 k2)) \mvee{} (0 \mleq{} (compare k2 k1)))
Date html generated:
2015_07_17-AM-08_19_27
Last ObjectModification:
2015_01_27-PM-00_37_21
Home
Index