Nuprl Lemma : decidable__equal_Kind
∀a,b:Knd. Dec(a = b ∈ Knd)
Proof
Definitions occuring in Statement :
Knd: Knd,
decidable: Dec(P),
all: ∀x:A. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ,
implies: P ⇒ Q,
uiff: uiff(P;Q),
and: P ∧ Q,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Latex:
\mforall{}a,b:Knd. Dec(a = b)
Date html generated:
2016_05_16-AM-10_58_18
Last ObjectModification:
2015_12_29-AM-09_09_45
Theory : event-ordering
Home
Index