Nuprl Lemma : natInd4Boot
P:
. (((P 0) 
(i:. ((P (i 
4)) 
(P i)))) (n:. (P n)))
Proof
Definitions occuring in Statement :
nat: ,
prop: ,
all: x:A. B[x],
implies: P Q,
and: P Q,
apply: f a,
function: x:A B[x],
divide: n m,
natural_number: $n
Definitions :
all: x:A. B[x],
nat: ,
prop: ,
implies: P Q,
and: P Q,
member: t 
T,
le: A 
B,
not: 
A,
false: False,
so_lambda: 
x.t[x],
nat_plus: 
,
iff: P 
Q,
rev_implies: P Q,
int_seg: {i..j
},
lelt: i j < k,
nequal: a 
b T ,
int_nzero: 
,
uall: [x:A]. B[x],
so_apply: x[s],
bool: 
,
unit: Unit,
uimplies: b supposing a,
uiff: uiff(P;Q),
sq_type: SQType(T),
guard: {T},
it: 
,
btrue: tt,
bfalse: ff
Lemmas :
nat_wf,
le_wf,
all_wf,
divide_wf,
completeInductionBootStrap,
int_seg_wf,
eq_int_wf,
bool_wf,
uiff_transitivity,
equal_wf,
subtype_rel_weakening,
ext-eq_weakening,
assert_wf,
eqtt_to_assert,
assert_of_eq_int,
iff_transitivity,
bnot_wf,
not_wf,
iff_weakening_uiff,
eqff_to_assert,
assert_of_bnot,
subtype_base_sq,
int_subtype_base,
lelt_wf,
div_rem_sum,
nequal_wf
\mforall{}P:\mBbbN{} {}\mrightarrow{} \mBbbP{}. (((P 0) \mwedge{} (\mforall{}i:\mBbbN{}. ((P (i \mdiv{} 4)) {}\mRightarrow{} (P i)))) {}\mRightarrow{} (\mforall{}n:\mBbbN{}. (P n)))
Date html generated:
2013_03_20-AM-09_47_01
Last ObjectModification:
2012_11_27-AM-10_31_58
Home
Index