Nuprl Lemma : csm-cubical-sigma-typed
∀X,Delta:j⊢. ∀A:{X ⊢ _}. ∀B:{X.A ⊢ _}. ∀s:Delta j⟶ X. ((Σ A B)s = Σ (A)s (B)(s)dep ∈ {Delta ⊢ _})
Proof
Definitions occuring in Statement :
cubical-sigma: Σ A B,
csm-dependent: (s)dep,
cube-context-adjoin: X.A,
csm-ap-type: (AF)s,
cubical-type: {X ⊢ _},
cube_set_map: A ⟶ B,
cubical_set: CubicalSet,
all: ∀x:A. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
cubical_set: CubicalSet,
uall: ∀[x:A]. B[x],
cube-context-adjoin: X.A,
psc-adjoin: X.A,
I_cube: A(I),
I_set: A(I),
cubical-type-at: A(a),
presheaf-type-at: A(a),
cube-set-restriction: f(s),
psc-restriction: f(s),
cubical-type-ap-morph: (u a f),
presheaf-type-ap-morph: (u a f),
cube_set_map: A ⟶ B,
csm-ap-type: (AF)s,
pscm-ap-type: (AF)s,
cubical-sigma: Σ A B,
presheaf-sigma: Σ A B,
cc-adjoin-cube: (v;u),
psc-adjoin-set: (v;u),
csm-ap: (s)x,
pscm-ap: (s)x,
csm-dependent: (s)dep,
pscm-dependent: (s)dep,
csm-adjoin: (s;u),
pscm-adjoin: (s;u),
csm-comp: G o F,
pscm-comp: G o F,
typed-cc-fst: tp{i:l},
typed-psc-fst: tp{i:l},
cc-fst: p,
psc-fst: p,
typed-cc-snd: tq,
typed-psc-snd: tq,
cc-snd: q,
psc-snd: q
Lemmas referenced :
pscm-presheaf-sigma-typed,
cube-cat_wf,
cubical-type-sq-presheaf-type
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
dependent_functionElimination,
thin,
hypothesis,
sqequalRule,
isectElimination,
Error :memTop
Latex:
\mforall{}X,Delta:j\mvdash{}. \mforall{}A:\{X \mvdash{} \_\}. \mforall{}B:\{X.A \mvdash{} \_\}. \mforall{}s:Delta j{}\mrightarrow{} X. ((\mSigma{} A B)s = \mSigma{} (A)s (B)(s)dep)
Date html generated:
2020_05_20-PM-02_26_53
Last ObjectModification:
2020_04_03-PM-08_37_12
Theory : cubical!type!theory
Home
Index