Nuprl Lemma : unionset_wf2
∀[s:Set{i:l}]. (⋃(s) ∈ Set{i:l})
Proof
Definitions occuring in Statement :
unionset: ⋃(s),
Set: Set{i:l},
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
so_apply: x[s],
prop: ℙ,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
unionset: ⋃(s),
member: t ∈ T,
uall: ∀[x:A]. B[x]
Lemmas referenced :
set-subtype-coSet,
setmem_wf,
Set_wf,
setunionfun_wf2
Rules used in proof :
equalitySymmetry,
equalityTransitivity,
axiomEquality,
because_Cache,
applyEquality,
cumulativity,
setEquality,
hypothesis,
rename,
setElimination,
lambdaEquality,
hypothesisEquality,
thin,
isectElimination,
sqequalHypSubstitution,
extract_by_obid,
sqequalRule,
cut,
introduction,
isect_memberFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution
Latex:
\mforall{}[s:Set\{i:l\}]. (\mcup{}(s) \mmember{} Set\{i:l\})
Date html generated:
2018_07_29-AM-09_53_00
Last ObjectModification:
2018_07_18-PM-02_41_43
Theory : constructive!set!theory
Home
Index