Nuprl Lemma : assert-eq-knd
∀[a,b:Knd]. uiff(↑a = b;a = b ∈ Knd)
Proof
Definitions occuring in Statement :
eq_knd: a = b,
Knd: Knd,
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
eq_knd: a = b,
all: ∀x:A. B[x],
implies: P ⇒ Q,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
prop: ℙ,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
eqof: eqof(d)
Latex:
\mforall{}[a,b:Knd]. uiff(\muparrow{}a = b;a = b)
Date html generated:
2016_05_16-AM-10_58_15
Last ObjectModification:
2015_12_29-AM-09_09_40
Theory : event-ordering
Home
Index