Nuprl Lemma : monus_of_add
n,a:
. ((n + a--a) ~ n)
Proof
Definitions occuring in Statement :
monus: (a--b),
nat: ,
all: x:A. B[x],
add: n + m,
sqequal: s ~ t
Definitions :
all: x:A. B[x],
monus: (a--b),
ifthenelse: if b then t else f fi ,
member: t 
T,
implies: P 
Q,
btrue: tt,
bfalse: ff,
exists: 
x:A. B[x],
not: 
A,
nat: ,
sq_type: SQType(T),
uall: [x:A]. B[x],
uimplies: b supposing a,
bool: 
,
unit: Unit,
assert: 
b,
uiff: uiff(P;Q),
and: P 
Q,
bnot: 
b,
or: P 
Q,
guard: {T},
false: False,
it: 
,
prop: 
Lemmas :
subtype_base_sq,
int_subtype_base,
lt_int_wf,
bool_wf,
eqtt_to_assert,
assert_of_lt_int,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
bool_subtype_base,
Error :assert-bnot,
less_than_wf,
nat_wf
\mforall{}n,a:\mBbbN{}. ((n + a--a) \msim{} n)
Date html generated:
2013_03_20-AM-10_37_58
Last ObjectModification:
2013_03_16-PM-00_48_46
Home
Index