Nuprl Lemma : typed-cc-fst_wf
∀[G:j⊢]. ∀[A:{G ⊢ _}]. (tp{i:l} ∈ G.A ij⟶ G)
Proof
Definitions occuring in Statement :
typed-cc-fst: tp{i:l},
cube-context-adjoin: X.A,
cubical-type: {X ⊢ _},
cube_set_map: A ⟶ B,
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,
cube_set_map: A ⟶ B,
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),
typed-cc-fst: tp{i:l},
typed-psc-fst: tp{i:l},
cc-fst: p,
psc-fst: p
Lemmas referenced :
typed-psc-fst_wf,
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{}[G:j\mvdash{}]. \mforall{}[A:\{G \mvdash{} \_\}]. (tp\{i:l\} \mmember{} G.A ij{}\mrightarrow{} G)
Date html generated:
2020_05_20-PM-01_55_19
Last ObjectModification:
2020_04_04-AM-09_36_49
Theory : cubical!type!theory
Home
Index