Nuprl Lemma : aa_fib_count_wf
n:
. (aa_fib_count(n) 
)
Proof
Definitions occuring in Statement :
aa_fib_count: aa_fib_count(m),
nat: ,
all: x:A. B[x],
member: t T,
product: x:A B[x]
Definitions :
all: x:A. B[x],
member: t T,
implies: P 
Q,
ge: i 
j ,
le: A 
B,
not: 
A,
false: False,
uimplies: b supposing a,
nat: ,
aa_fib_count: aa_fib_count(m),
or: P 
Q,
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff,
and: P 
Q,
iff: P 
Q,
rev_implies: P Q,
squash: 
T,
true: True,
so_lambda: 
x.t[x],
guard: {T},
uall: [x:A]. B[x],
prop: 
,
sq_type: SQType(T),
uiff: uiff(P;Q),
so_apply: x[s]
Lemmas :
nat_wf,
nat_properties,
ge_wf,
subtype_rel_self,
less_than_wf,
le_wf,
bor_wf,
eq_int_wf,
assert_wf,
or_wf,
equal_wf,
bnot_wf,
not_wf,
bool_cases,
subtype_base_sq,
bool_wf,
bool_subtype_base,
eqtt_to_assert,
iff_transitivity,
iff_weakening_uiff,
assert_of_bor,
assert_of_eq_int,
eqff_to_assert,
assert_of_bnot,
subtype_rel_set_simple,
add_nat_wf,
pi1_wf_top,
subtype_rel_simple_product,
top_wf,
subtype_top,
pi2_wf
\mforall{}n:\mBbbN{}. (aa\_fib\_count(n) \mmember{} \mBbbN{} \mtimes{} \mBbbN{})
Date html generated:
2013_03_20-AM-09_57_26
Last ObjectModification:
2012_11_27-AM-10_33_50
Home
Index