Nuprl Lemma : plus-set_functionality
∀a,a':coSet{i:l}. (seteq(a;a') ⇒ seteq((a)+;(a')+))
Proof
Definitions occuring in Statement :
plus-set: (a)+,
seteq: seteq(s1;s2),
coSet: coSet{i:l},
all: ∀x:A. B[x],
implies: P ⇒ Q
Definitions unfolded in proof :
or: P ∨ Q,
guard: {T},
prop: ℙ,
rev_implies: P ⇐ Q,
and: P ∧ Q,
iff: P ⇐⇒ Q,
uall: ∀[x:A]. B[x],
member: t ∈ T,
implies: P ⇒ Q,
all: ∀x:A. B[x]
Lemmas referenced :
coSet_wf,
setmem-plus-set,
iff_wf,
seteq_functionality,
seteq_weakening,
setmem_functionality,
seteq_wf,
setmem_wf,
or_wf,
plus-set_wf,
co-seteq-iff
Rules used in proof :
orLevelFunctionality,
orFunctionality,
impliesFunctionality,
addLevel,
because_Cache,
independent_pairFormation,
independent_functionElimination,
productElimination,
hypothesis,
hypothesisEquality,
isectElimination,
thin,
dependent_functionElimination,
sqequalHypSubstitution,
extract_by_obid,
introduction,
cut,
lambdaFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution
Latex:
\mforall{}a,a':coSet\{i:l\}. (seteq(a;a') {}\mRightarrow{} seteq((a)+;(a')+))
Date html generated:
2018_07_29-AM-10_00_14
Last ObjectModification:
2018_07_18-PM-01_34_24
Theory : constructive!set!theory
Home
Index