Nuprl Lemma : cubical-app_wf_fun
∀[X:j⊢]. ∀[A,B:{X ⊢ _}]. ∀[w:{X ⊢ _:(A ⟶ B)}]. ∀[u:{X ⊢ _:A}]. (app(w; u) ∈ {X ⊢ _:B})
Proof
Definitions occuring in Statement :
cubical-app: app(w; u),
cubical-fun: (A ⟶ B),
cubical-term: {X ⊢ _:A},
cubical-type: {X ⊢ _},
cubical_set: CubicalSet,
uall: ∀[x:A]. B[x],
member: 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-app: app(w; u),
presheaf-app: app(w; u)
Lemmas referenced :
presheaf-app_wf_fun,
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)\}]. \mforall{}[u:\{X \mvdash{} \_:A\}]. (app(w; u) \mmember{} \{X \mvdash{} \_:B\})
Date html generated:
2020_05_20-PM-02_26_00
Last ObjectModification:
2020_04_03-PM-08_36_10
Theory : cubical!type!theory
Home
Index