Nuprl Lemma : fan_26_6a_prin27_5_imp_fan27_7a
fan_26_6a{i:l}() 
brouwer_prin_27_5{i:l}() fan_27_7a{i:l}()
Proof
Definitions occuring in Statement :
fan_27_7a: fan_27_7a{i:l}(),
brouwer_prin_27_5: brouwer_prin_27_5{i:l}(),
fan_26_6a: fan_26_6a{i:l}(),
implies: P Q
Definitions :
implies: P Q,
fan_27_7a: fan_27_7a{i:l}(),
all: 
x:A. B[x],
prop: 
,
exists: 
x:A. B[x],
member: t 
T,
so_lambda: 
x.t[x],
nat: 
,
le: A 
B,
ifthenelse: if b then t else f fi ,
btrue: tt,
not: 
A,
false: False,
bfalse: ff,
gt: i > j,
fin_spr: fin_spr(B),
and: P 
Q,
int_seg: {i..j
},
lelt: i j < k,
fan_26_6a: fan_26_6a{i:l}(),
brouwer_prin_27_5: brouwer_prin_27_5{i:l}(),
uall: [x:A]. B[x],
so_apply: x[s],
bool: 
,
unit: Unit,
uimplies: b supposing a,
assert: 
b,
uiff: uiff(P;Q),
bnot: 
b,
or: P 
Q,
sq_type: SQType(T),
guard: {T},
iff: P 
Q,
exists_uni: Error :exists_uni,
rev_implies: P Q,
in_fin_spr: (f fspr(B)),
it: 
Lemmas :
all_wf,
nat_wf,
in_fin_spr_wf,
exists_wf,
Error :list_wf,
brouwer_prin_27_5_wf,
fan_26_6a_wf,
fin_spr_is_spr,
list-in-fin_spr_wf,
bool_wf,
eqtt_to_assert,
le_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
Error :assert-bnot,
in_spr_wf,
in_fspr_iff_in_spr_of_fin_spr,
gt_wf,
decidable__lt,
fin_spr_wf,
fin_spr_mem_in_fin_spr,
mklist_wf,
subtype_rel_set,
int_seg_wf,
subtype_rel_dep_function,
subtype_rel_sets,
lelt_wf,
equal_upto_wf,
monus_wf,
equal_upto_mklist_eq
fan\_26\_6a\{i:l\}() {}\mRightarrow{} brouwer\_prin\_27\_5\{i:l\}() {}\mRightarrow{} fan\_27\_7a\{i:l\}()
Date html generated:
2013_03_20-AM-10_39_20
Last ObjectModification:
2013_03_17-PM-06_23_46
Home
Index