Nuprl Lemma : glue-cube_wf
∀[Gamma:j⊢]. ∀[A:{Gamma ⊢ _}]. ∀[phi:{Gamma ⊢ _:𝔽}]. ∀[T:{Gamma, phi ⊢ _}]. ∀[w:{Gamma, phi ⊢ _:(T ⟶ A)}].
∀[I:fset(ℕ)]. ∀[rho:Gamma(I)].
(glue-cube(Gamma;A;phi;T;w;I;rho) ∈ Type)
Proof
Definitions occuring in Statement :
glue-cube: glue-cube(Gamma;A;phi;T;w;I;rho),
context-subset: Gamma, phi,
face-type: 𝔽,
cubical-fun: (A ⟶ B),
cubical-term: {X ⊢ _:A},
cubical-type: {X ⊢ _},
I_cube: A(I),
cubical_set: CubicalSet,
fset: fset(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
glue-cube: glue-cube(Gamma;A;phi;T;w;I;rho),
member: t ∈ T,
subtype_rel: A ⊆r B,
cubical-type-at: A(a),
pi1: fst(t),
face-type: 𝔽,
constant-cubical-type: (X),
I_cube: A(I),
functor-ob: ob(F),
face-presheaf: 𝔽,
lattice-point: Point(l),
record-select: r.x,
face_lattice: face_lattice(I),
face-lattice: face-lattice(T;eq),
free-dist-lattice-with-constraints: free-dist-lattice-with-constraints(T;eq;x.Cs[x]),
constrained-antichain-lattice: constrained-antichain-lattice(T;eq;P),
mk-bounded-distributive-lattice: mk-bounded-distributive-lattice,
mk-bounded-lattice: mk-bounded-lattice(T;m;j;z;o),
record-update: r[x := v],
ifthenelse: if b then t else f fi ,
eq_atom: x =a y,
bfalse: ff,
btrue: tt,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
bdd-distributive-lattice: BoundedDistributiveLattice,
so_lambda: λ2x.t[x],
prop: ℙ,
so_apply: x[s],
context-subset: Gamma, phi,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
rev_implies: P ⇐ Q,
iff: P ⇐⇒ Q
Lemmas referenced :
fl-eq_wf,
cubical-term-at_wf,
face-type_wf,
subtype_rel_self,
lattice-point_wf,
face_lattice_wf,
lattice-1_wf,
eqtt_to_assert,
assert-fl-eq,
subtype_rel_set,
bounded-lattice-structure_wf,
lattice-structure_wf,
lattice-axioms_wf,
bounded-lattice-structure-subtype,
bounded-lattice-axioms_wf,
equal_wf,
lattice-meet_wf,
lattice-join_wf,
I_cube_pair_redex_lemma,
cubical-type-at_wf,
context-subset_wf,
eqff_to_assert,
bool_cases_sqequal,
subtype_base_sq,
bool_wf,
bool_subtype_base,
assert-bnot,
iff_weakening_uiff,
assert_wf,
fset_wf,
nat_wf,
names-hom_wf,
cube-set-restriction_wf,
glue-equations_wf,
I_cube_wf,
istype-cubical-term,
cubical-fun_wf,
thin-context-subset,
cubical-type_wf,
cubical_set_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
applyEquality,
sqequalRule,
because_Cache,
inhabitedIsType,
lambdaFormation_alt,
unionElimination,
equalityElimination,
equalityTransitivity,
equalitySymmetry,
productElimination,
independent_isectElimination,
instantiate,
lambdaEquality_alt,
productEquality,
cumulativity,
isectEquality,
universeIsType,
setElimination,
rename,
dependent_functionElimination,
Error :memTop,
dependent_set_memberEquality_alt,
equalityIstype,
dependent_pairFormation_alt,
promote_hyp,
independent_functionElimination,
voidElimination,
setEquality,
functionEquality
Latex:
\mforall{}[Gamma:j\mvdash{}]. \mforall{}[A:\{Gamma \mvdash{} \_\}]. \mforall{}[phi:\{Gamma \mvdash{} \_:\mBbbF{}\}]. \mforall{}[T:\{Gamma, phi \mvdash{} \_\}].
\mforall{}[w:\{Gamma, phi \mvdash{} \_:(T {}\mrightarrow{} A)\}]. \mforall{}[I:fset(\mBbbN{})]. \mforall{}[rho:Gamma(I)].
(glue-cube(Gamma;A;phi;T;w;I;rho) \mmember{} Type)
Date html generated:
2020_05_20-PM-05_38_50
Last ObjectModification:
2020_04_21-PM-05_16_30
Theory : cubical!type!theory
Home
Index