Nuprl Lemma : not_funcNbarB_decidable_eq_fullExt
(
t1,t2:
bar(
). Dec(t1 = t2))
Proof
Definitions occuring in Statement :
bool: ,
nat: ,
decidable: Dec(P),
all: x:A. B[x],
not: A,
function: x:A B[x],
equal: s = t
Definitions :
not: A,
bool: ,
implies: P 
Q,
member: t 
T,
so_lambda: 
x.t[x],
all: x:A. B[x],
decidable: Dec(P),
exists: 
x:A. B[x],
iff: P 
Q,
assert: 
b,
isl: isl(x),
unit: Unit,
btrue: tt,
bfalse: ff,
it: 
,
prop: 
,
or: P 
Q,
and: P 
Q,
rev_implies: P Q,
ifthenelse: if b then t else f fi ,
true: True,
false: False,
nat: ,
le: A 
B,
has-value: (a)
,
uall: [x:A]. B[x],
so_apply: x[s],
uimplies: b supposing a,
uiff: uiff(P;Q),
sq_type: SQType(T),
guard: {T}
Lemmas :
all_wf,
nat_wf,
Error :bar_wf,
bool_wf,
union-value-type,
unit_wf2,
decidable_wf,
equal_wf,
subtype_rel_self,
or_wf,
not_wf,
btrue_wf,
bfalse_wf,
true_wf,
false_wf,
iff_wf,
assert_wf,
isl_wf,
Error :bottom_wf,
Error :subtype_bar,
ifthenelse_wf,
Error :fixpoint-induction2,
Error :bool-mono,
subtype_rel_weakening,
ext-eq_weakening,
eqtt_to_assert,
bool_cases,
subtype_base_sq,
bool_subtype_base,
eqff_to_assert,
assert_of_bnot,
uiff_transitivity,
bnot_wf,
assert_elim,
le_wf,
Error :not-btrue-sqeq-bottom,
and_wf,
not_assert_elim
\mneg{}(\mforall{}t1,t2:\mBbbN{} {}\mrightarrow{} bar(\mBbbB{}). Dec(t1 = t2))
Date html generated:
2013_03_20-AM-09_48_14
Last ObjectModification:
2012_11_27-AM-10_32_01
Home
Index