Nuprl Lemma : cubical-fun-eta
∀[X:j⊢]. ∀[A,B:{X ⊢ _}]. ∀[w:{X ⊢ _:(A ⟶ B)}]. (cubical-lam(X;app((w)p; q)) = w ∈ {X ⊢ _:(A ⟶ B)})
Proof
Definitions occuring in Statement :
cubical-app: app(w; u),
cubical-lam: cubical-lam(X;b),
cubical-fun: (A ⟶ B),
cc-snd: q,
cc-fst: p,
csm-ap-term: (t)s,
cubical-term: {X ⊢ _:A},
cubical-type: {X ⊢ _},
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,
cubical-fun: (A ⟶ B),
presheaf-fun: (A ⟶ B),
cubical-fun-family: cubical-fun-family(X; A; B; I; a),
presheaf-fun-family: presheaf-fun-family(C; X; A; B; I; a),
cube-cat: CubeCat,
all: ∀x:A. B[x],
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),
cubical-lam: cubical-lam(X;b),
presheaf-lam: presheaf-lam(X;b),
cubical-lambda: (λb),
presheaf-lambda: (λb),
cubical-app: app(w; u),
presheaf-app: app(w; u),
csm-ap-term: (t)s,
pscm-ap-term: (t)s,
csm-ap: (s)x,
pscm-ap: (s)x,
cc-fst: p,
psc-fst: p,
cc-snd: q,
psc-snd: q,
cc-adjoin-cube: (v;u),
psc-adjoin-set: (v;u)
Lemmas referenced :
presheaf-fun-eta,
cube-cat_wf,
cubical-type-sq-presheaf-type,
cat_ob_pair_lemma,
cat_arrow_triple_lemma,
cat_comp_tuple_lemma,
cubical-term-sq-presheaf-term,
cat_id_tuple_lemma
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isectElimination,
thin,
hypothesis,
sqequalRule,
Error :memTop,
dependent_functionElimination
Latex:
\mforall{}[X:j\mvdash{}]. \mforall{}[A,B:\{X \mvdash{} \_\}]. \mforall{}[w:\{X \mvdash{} \_:(A {}\mrightarrow{} B)\}]. (cubical-lam(X;app((w)p; q)) = w)
Date html generated:
2020_05_20-PM-02_30_36
Last ObjectModification:
2020_04_03-PM-08_40_53
Theory : cubical!type!theory
Home
Index