Nuprl Lemma : cubical-type-ap-morph-comp
∀[X:j⊢]. ∀[A:{X ⊢ _}]. ∀[I,J,K:fset(ℕ)]. ∀[f:J ⟶ I]. ∀[g:K ⟶ J]. ∀[a:X(I)]. ∀[u:A(a)].
(((u a f) f(a) g) = (u a f ⋅ g) ∈ A(f ⋅ g(a)))
Proof
Definitions occuring in Statement :
cubical-type-ap-morph: (u a f),
cubical-type-at: A(a),
cubical-type: {X ⊢ _},
cube-set-restriction: f(s),
I_cube: A(I),
cubical_set: CubicalSet,
nh-comp: g ⋅ f,
names-hom: I ⟶ J,
fset: fset(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T
Lemmas referenced :
cubical-type-ap-morph-comp-general,
istype-cubical-type-at,
I_cube_wf,
names-hom_wf,
fset_wf,
nat_wf,
cubical-type_wf,
cubical_set_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
introduction,
cut,
thin,
instantiate,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
hypothesis,
sqequalRule,
isect_memberEquality_alt,
axiomEquality,
isectIsTypeImplies,
inhabitedIsType,
universeIsType
Latex:
\mforall{}[X:j\mvdash{}]. \mforall{}[A:\{X \mvdash{} \_\}]. \mforall{}[I,J,K:fset(\mBbbN{})]. \mforall{}[f:J {}\mrightarrow{} I]. \mforall{}[g:K {}\mrightarrow{} J]. \mforall{}[a:X(I)]. \mforall{}[u:A(a)].
(((u a f) f(a) g) = (u a f \mcdot{} g))
Date html generated:
2020_05_20-PM-01_48_14
Last ObjectModification:
2020_04_03-PM-08_26_03
Theory : cubical!type!theory
Home
Index