Nuprl Lemma : sub_cubical_set_functionality2
∀[Y,X:j⊢]. ∀[phi:{X ⊢ _:𝔽}]. sub_cubical_set{j:l}(Y, phi; X, phi) supposing sub_cubical_set{j:l}(Y; X)
Proof
Definitions occuring in Statement :
context-subset: Gamma, phi,
face-type: 𝔽,
cubical-term: {X ⊢ _:A},
sub_cubical_set: Y ⊆ X,
cubical_set: CubicalSet,
uimplies: b supposing a,
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
context-subset: Gamma, phi,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
prop: ℙ,
bdd-distributive-lattice: BoundedDistributiveLattice,
and: P ∧ Q,
so_apply: x[s],
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,
implies: P ⇒ Q,
squash: ↓T,
true: True,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
sub_cubical_set: Y ⊆ X
Lemmas referenced :
implies-sub_cubical_set,
context-subset_wf,
subset-cubical-term,
face-type_wf,
I_cube_pair_redex_lemma,
subtype_rel_sets,
I_cube_wf,
equal_wf,
lattice-point_wf,
face_lattice_wf,
subtype_rel_set,
bounded-lattice-structure_wf,
lattice-structure_wf,
lattice-axioms_wf,
bounded-lattice-structure-subtype,
bounded-lattice-axioms_wf,
lattice-meet_wf,
lattice-join_wf,
cubical-term-at_wf,
subtype_rel_self,
lattice-1_wf,
subset-I_cube,
fset_wf,
nat_wf,
cube_set_restriction_pair_lemma,
squash_wf,
true_wf,
istype-universe,
face-term-at-restriction-eq-1,
iff_weakening_equal,
subset-restriction,
cube-set-restriction_wf,
names-hom_wf,
sub_cubical_set_wf,
cubical-term_wf,
cubical_set_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
introduction,
cut,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
applyEquality,
independent_isectElimination,
hypothesis,
sqequalRule,
dependent_functionElimination,
Error :memTop,
lambdaFormation_alt,
instantiate,
cumulativity,
lambdaEquality_alt,
productEquality,
isectEquality,
because_Cache,
universeIsType,
setElimination,
rename,
inhabitedIsType,
equalityTransitivity,
equalitySymmetry,
equalityIstype,
imageElimination,
universeEquality,
natural_numberEquality,
imageMemberEquality,
baseClosed,
productElimination,
independent_functionElimination,
dependent_set_memberEquality_alt,
setIsType,
axiomEquality,
isect_memberEquality_alt,
isectIsTypeImplies
Latex:
\mforall{}[Y,X:j\mvdash{}]. \mforall{}[phi:\{X \mvdash{} \_:\mBbbF{}\}].
sub\_cubical\_set\{j:l\}(Y, phi; X, phi) supposing sub\_cubical\_set\{j:l\}(Y; X)
Date html generated:
2020_05_20-PM-02_57_18
Last ObjectModification:
2020_04_04-PM-05_11_53
Theory : cubical!type!theory
Home
Index