Nuprl Lemma : rv-perm-inv
∀[rv,x:Top]. (x^-1 ~ let f,g = x in <g, f>)
Proof
Definitions occuring in Statement :
rv-permutation-group: Perm(rv),
sg-inv: x^-1,
uall: ∀[x:A]. B[x],
top: Top,
spread: spread def,
pair: <a, b>,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
btrue: tt,
bfalse: ff,
ifthenelse: if b then t else f fi ,
eq_atom: x =a y,
top: Top,
member: t ∈ T,
all: ∀x:A. B[x],
mk-s-group: mk-s-group(ss; e; i; o; sep; invsep),
permutation-s-group: Perm(rv),
sg-inv: x^-1,
rv-permutation-group: Perm(rv)
Lemmas referenced :
top_wf,
rec_select_update_lemma
Rules used in proof :
because_Cache,
hypothesisEquality,
isectElimination,
sqequalAxiom,
isect_memberFormation,
hypothesis,
voidEquality,
voidElimination,
isect_memberEquality,
thin,
dependent_functionElimination,
sqequalHypSubstitution,
extract_by_obid,
introduction,
cut,
computationStep,
sqequalTransitivity,
sqequalReflexivity,
sqequalRule,
sqequalSubstitution
Latex:
\mforall{}[rv,x:Top]. (x\^{}-1 \msim{} let f,g = x in <g, f>)
Date html generated:
2016_11_08-AM-09_20_57
Last ObjectModification:
2016_11_03-AM-11_39_27
Theory : inner!product!spaces
Home
Index