Nuprl Lemma : named-path_wf
∀[X:CubicalSet]. ∀[A:{X ⊢ _}]. ∀[a,b:{X ⊢ _:A}]. ∀[I:Cname List]. ∀[alpha:X(I)]. ∀[z:Cname].
named-path(X;A;a;b;I;alpha;z) ∈ Type supposing ¬(z ∈ I)
Proof
Definitions occuring in Statement :
named-path: named-path(X;A;a;b;I;alpha;z),
cubical-term: {X ⊢ _:AF},
cubical-type: {X ⊢ _},
I-cube: X(I),
cubical-set: CubicalSet,
coordinate_name: Cname,
l_member: (x ∈ l),
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
named-path: named-path(X;A;a;b;I;alpha;z),
prop: ℙ
Lemmas referenced :
cubical-type-at_wf,
cons_wf,
coordinate_name_wf,
cube-set-restriction_wf,
iota_wf,
name-path-endpoints_wf,
not_wf,
l_member_wf,
I-cube_wf,
list_wf,
cubical-term_wf,
cubical-type_wf,
cubical-set_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
setEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
independent_isectElimination,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[X:CubicalSet]. \mforall{}[A:\{X \mvdash{} \_\}]. \mforall{}[a,b:\{X \mvdash{} \_:A\}]. \mforall{}[I:Cname List]. \mforall{}[alpha:X(I)]. \mforall{}[z:Cname].
named-path(X;A;a;b;I;alpha;z) \mmember{} Type supposing \mneg{}(z \mmember{} I)
Date html generated:
2016_06_16-PM-07_27_45
Last ObjectModification:
2015_12_28-PM-04_14_35
Theory : cubical!sets
Home
Index