Nuprl Lemma : sigma-unelim-p
∀[X:j⊢]. ∀[A:{X ⊢ _}]. ∀[B:{X.A ⊢ _}]. (p o SigmaUnElim = p o p ∈ X.A.B ij⟶ X)
Proof
Definitions occuring in Statement :
sigma-unelim-csm: SigmaUnElim,
cubical-sigma: Σ A B,
cc-fst: p,
cube-context-adjoin: X.A,
cubical-type: {X ⊢ _},
csm-comp: G o F,
cube_set_map: A ⟶ B,
cubical_set: CubicalSet,
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
cubical_set: CubicalSet,
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-comp: G o F,
pscm-comp: G o F,
cc-fst: p,
psc-fst: p,
sigma-unelim-csm: SigmaUnElim,
sigma-unelim-pscm: SigmaUnElim,
cc-adjoin-cube: (v;u),
psc-adjoin-set: (v;u)
Lemmas referenced :
ps-sigma-unelim-p,
cube-cat_wf,
cubical-type-sq-presheaf-type
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isectElimination,
thin,
hypothesis,
sqequalRule,
Error :memTop
Latex:
\mforall{}[X:j\mvdash{}]. \mforall{}[A:\{X \mvdash{} \_\}]. \mforall{}[B:\{X.A \mvdash{} \_\}]. (p o SigmaUnElim = p o p)
Date html generated:
2020_05_20-PM-02_28_39
Last ObjectModification:
2020_04_04-AM-09_25_55
Theory : cubical!type!theory
Home
Index