Nuprl Lemma : s-comp-nc-0
∀[I:fset(ℕ)]. ∀[i:ℕ]. s ⋅ (i0) = 1 ∈ I ⟶ I supposing ¬i ∈ I
Proof
Definitions occuring in Statement :
nc-0: (i0),
nc-s: s,
add-name: I+i,
nh-comp: g ⋅ f,
nh-id: 1,
names-hom: I ⟶ J,
fset-member: a ∈ s,
fset: fset(T),
int-deq: IntDeq,
nat: ℕ,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
prop: ℙ,
subtype_rel: A ⊆r B,
nat: ℕ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
fset_wf,
strong-subtype-self,
le_wf,
strong-subtype-set3,
strong-subtype-deq-subtype,
int-deq_wf,
nat_wf,
fset-member_wf,
not_wf,
dM0_wf,
s-comp-nc-p,
nc-0-as-nc-p
Rules used in proof :
cut,
lemma_by_obid,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
hypothesis,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
sqequalRule,
because_Cache,
independent_isectElimination,
applyEquality,
intEquality,
lambdaEquality,
natural_numberEquality
Latex:
\mforall{}[I:fset(\mBbbN{})]. \mforall{}[i:\mBbbN{}]. s \mcdot{} (i0) = 1 supposing \mneg{}i \mmember{} I
Date html generated:
2016_05_18-PM-00_01_25
Last ObjectModification:
2016_02_05-PM-00_51_49
Theory : cubical!type!theory
Home
Index