Nuprl Lemma : subset-iota_wf
∀[I:fset(ℕ)]. ∀[psi:𝔽(I)].  (iota ∈ I,psi j⟶ formal-cube(I))
Proof
Definitions occuring in Statement : 
subset-iota: iota
, 
cubical-subset: I,psi
, 
face-presheaf: 𝔽
, 
cube_set_map: A ⟶ B
, 
formal-cube: formal-cube(I)
, 
I_cube: A(I)
, 
fset: fset(T)
, 
nat: ℕ
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
subset-iota: iota
, 
cube_set_map: A ⟶ B
, 
cube-cat: CubeCat
, 
psc_map: A ⟶ B
, 
type-cat: TypeCat
, 
op-cat: op-cat(C)
, 
nat-trans: nat-trans(C;D;F;G)
, 
spreadn: spread4, 
all: ∀x:A. B[x]
, 
functor-arrow: arrow(F)
, 
functor-ob: ob(F)
, 
cubical-subset: I,psi
, 
formal-cube: formal-cube(I)
, 
pi1: fst(t)
, 
pi2: snd(t)
, 
rep-sub-sheaf: rep-sub-sheaf(C;X;P)
, 
cat-comp: cat-comp(C)
, 
compose: f o g
, 
cat-arrow: cat-arrow(C)
, 
subtype_rel: A ⊆r B
, 
I_cube: A(I)
, 
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
, 
bdd-distributive-lattice: BoundedDistributiveLattice
, 
so_lambda: λ2x.t[x]
, 
prop: ℙ
, 
and: P ∧ Q
, 
so_apply: x[s]
, 
uimplies: b supposing a
, 
name-morph-satisfies: (psi f) = 1
, 
squash: ↓T
, 
true: True
, 
guard: {T}
, 
iff: P 
⇐⇒ Q
, 
rev_implies: P 
⇐ Q
, 
implies: P 
⇒ Q
, 
bounded-lattice-hom: Hom(l1;l2)
, 
lattice-hom: Hom(l1;l2)
Lemmas referenced : 
face-presheaf_wf, 
cat_arrow_triple_lemma, 
cat_comp_tuple_lemma, 
cat_ob_pair_lemma, 
names-hom_wf, 
name-morph-satisfies_wf, 
subtype_rel_self, 
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, 
equal_wf, 
lattice-meet_wf, 
lattice-join_wf, 
nh-comp_wf, 
squash_wf, 
true_wf, 
istype-universe, 
fl-morph-comp, 
lattice-1_wf, 
iff_weakening_equal, 
fl-morph_wf, 
I_cube_wf, 
face-presheaf_wf2, 
fset_wf, 
nat_wf, 
fl-morph-1
Rules used in proof : 
cut, 
introduction, 
extract_by_obid, 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation_alt, 
sqequalRule, 
sqequalHypSubstitution, 
dependent_functionElimination, 
thin, 
Error :memTop, 
hypothesis, 
dependent_set_memberEquality_alt, 
lambdaEquality_alt, 
setElimination, 
rename, 
hypothesisEquality, 
setIsType, 
universeIsType, 
isectElimination, 
because_Cache, 
applyEquality, 
instantiate, 
productEquality, 
cumulativity, 
isectEquality, 
independent_isectElimination, 
inhabitedIsType, 
lambdaFormation_alt, 
functionIsType, 
equalityIstype, 
imageElimination, 
equalityTransitivity, 
equalitySymmetry, 
universeEquality, 
natural_numberEquality, 
imageMemberEquality, 
baseClosed, 
productElimination, 
independent_functionElimination
Latex:
\mforall{}[I:fset(\mBbbN{})].  \mforall{}[psi:\mBbbF{}(I)].    (iota  \mmember{}  I,psi  j{}\mrightarrow{}  formal-cube(I))
Date html generated:
2020_05_20-PM-01_45_27
Last ObjectModification:
2020_04_17-PM-01_30_06
Theory : cubical!type!theory
Home
Index