Nuprl Lemma : seteq_inversion
∀s1,s2:coSet{i:l}. (seteq(s1;s2) ⇒ seteq(s2;s1))
Proof
Definitions occuring in Statement :
seteq: seteq(s1;s2),
coSet: coSet{i:l},
all: ∀x:A. B[x],
implies: P ⇒ Q
Definitions unfolded in proof :
member: t ∈ T
Lemmas referenced :
seteqinv_wf
Rules used in proof :
hypothesis,
extract_by_obid,
cut,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution,
introduction
Latex:
\mforall{}s1,s2:coSet\{i:l\}. (seteq(s1;s2) {}\mRightarrow{} seteq(s2;s1))
Date html generated:
2018_07_29-AM-09_51_11
Last ObjectModification:
2018_07_11-PM-00_08_30
Theory : constructive!set!theory
Home
Index