Nuprl Lemma : orderedpair-snd_functionality
∀a,b:coSet{i:l}. (seteq(a;b) ⇒ seteq(snd(a);snd(b)))
Proof
Definitions occuring in Statement :
orderedpair-snd: snd(pr),
seteq: seteq(s1;s2),
coSet: coSet{i:l},
all: ∀x:A. B[x],
implies: P ⇒ Q
Definitions unfolded in proof :
prop: ℙ,
rev_implies: P ⇐ Q,
and: P ∧ Q,
iff: P ⇐⇒ Q,
uall: ∀[x:A]. B[x],
member: t ∈ T,
orderedpair-snd: snd(pr),
implies: P ⇒ Q,
all: ∀x:A. B[x]
Lemmas referenced :
coSet_wf,
seteq_wf,
seteq_weakening,
orderedpair-snds_functionality,
singleitem_functionality,
orderedpair-snds_wf,
singleitem_wf,
seteq_functionality
Rules used in proof :
productElimination,
independent_functionElimination,
because_Cache,
hypothesis,
hypothesisEquality,
isectElimination,
thin,
dependent_functionElimination,
sqequalHypSubstitution,
extract_by_obid,
introduction,
cut,
sqequalRule,
lambdaFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution
Latex:
\mforall{}a,b:coSet\{i:l\}. (seteq(a;b) {}\mRightarrow{} seteq(snd(a);snd(b)))
Date html generated:
2018_07_29-AM-10_02_31
Last ObjectModification:
2018_07_18-PM-03_16_50
Theory : constructive!set!theory
Home
Index