Nuprl Lemma : fpf-compatible-singles-trivial
[A:Type]. [eq:EqDecider(A)]. [B:Top]. [x,y:A]. [v,u:Top]. x : v || y : u supposing 
(x = y)
Proof not projected
Definitions occuring in Statement :
fpf-single: x : v,
fpf-compatible: f || g,
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
so_apply: x[s],
not: A,
universe: Type,
equal: s = t,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
uimplies: b supposing a,
fpf-compatible: f || g,
member: t 
T,
all: x:A. B[x],
implies: P 
Q,
and: P 
Q,
so_lambda: 
x.t[x],
ifthenelse: if b then t else f fi ,
guard: {T},
bfalse: ff,
assert: 
b,
not: A,
so_apply: x[s],
false: False,
prop: 
,
iff: P 
Q,
eqof: eqof(d),
reduce: reduce(f;k;as),
pi1: fst(t),
deq-member: deq-member(eq;x;L),
fpf-single: x : v,
fpf-dom: x dom(f),
or: P 
Q,
deq: EqDecider(T)
Lemmas :
and_wf,
assert_wf,
fpf-dom_wf,
fpf-single_wf,
top_wf,
not_wf,
equal_wf,
deq_wf,
assert-deq,
or_functionality_wrt_uiff2,
assert_of_bor,
iff_weakening_uiff,
iff_transitivity,
and_functionality_wrt_iff,
false_wf,
or_wf,
bfalse_wf,
bor_wf
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:Top]. \mforall{}[x,y:A]. \mforall{}[v,u:Top]. x : v || y : u supposing \mneg{}(x = y)
Date html generated:
2012_01_23-AM-11_55_26
Last ObjectModification:
2011_12_10-PM-12_07_42
Home
Index