Nuprl Lemma : extend-face-term_wf
∀[I:fset(ℕ)]. ∀[phi:𝔽(I)]. ∀[u:{I,phi ⊢ _:𝔽}]. (extend-face-term(I;phi;u) ∈ 𝔽(I))
Proof
Definitions occuring in Statement :
extend-face-term: extend-face-term(I;phi;u),
face-type: 𝔽,
cubical-term: {X ⊢ _:A},
cubical-subset: I,psi,
face-presheaf: 𝔽,
I_cube: A(I),
fset: fset(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
face-presheaf: 𝔽,
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
uall: ∀[x:A]. B[x],
extend-face-term: extend-face-term(I;phi;u),
pi1: fst(t),
pi2: snd(t),
prop: ℙ,
so_lambda: λ2x.t[x],
subtype_rel: A ⊆r B,
implies: P ⇒ Q,
so_apply: x[s],
uimplies: b supposing a,
guard: {T},
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,
I_cube: A(I),
functor-ob: ob(F),
and: P ∧ Q,
bdd-distributive-lattice: BoundedDistributiveLattice,
cubical-subset: I,psi,
names-cat: NamesCat,
rep-sub-sheaf: rep-sub-sheaf(C;X;P),
cubical-type-at: A(a),
face-type: 𝔽,
constant-cubical-type: (X),
uiff: uiff(P;Q),
exists: ∃x:A. B[x],
cand: A c∧ B,
squash: ↓T,
name-morph-satisfies: (psi f) = 1,
bounded-lattice-hom: Hom(l1;l2),
lattice-hom: Hom(l1;l2),
true: True,
iff: P ⇐⇒ Q
Lemmas referenced :
I_cube_pair_redex_lemma,
face_lattice_components_wf,
set_wf,
fset_wf,
names_wf,
assert_wf,
fset-disjoint_wf,
names-deq_wf,
equal_wf,
lattice-fset-join_wf,
face_lattice_wf,
bdd-distributive-lattice-subtype-bdd-lattice,
decidable__equal_face_lattice,
fset-image_wf,
product-deq_wf,
deq-fset_wf,
strong-subtype-deq-subtype,
pi1_wf_top,
pi2_wf,
strong-subtype-set2,
face_lattice-deq_wf,
irr_face_wf,
fset-subtype2,
fset-member_wf,
cubical-term_wf,
cubical-subset_wf,
subtype_rel_self,
fset-antichain_wf,
union-deq_wf,
fset-all_wf,
fset-contains-none_wf,
face-lattice-constraints_wf,
face-type_wf,
lattice-point_wf,
subtype_rel_set,
bounded-lattice-structure_wf,
lattice-structure_wf,
lattice-axioms_wf,
bounded-lattice-structure-subtype,
bounded-lattice-axioms_wf,
uall_wf,
lattice-meet_wf,
lattice-join_wf,
nat_wf,
strong-subtype-set3,
cubical-term-at_wf,
cat_arrow_triple_lemma,
irr-face-morph_wf,
name-morph-satisfies_wf,
irr-face-morph-satisfies,
lattice-le_wf,
lattice-fset-join-is-lub,
member-fset-image-iff,
fl-morph_wf,
lattice-hom-le,
squash_wf,
true_wf,
bounded-lattice-hom_wf,
bdd-distributive-lattice_wf,
iff_weakening_equal,
lattice-1-le-iff
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
sqequalRule,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
isect_memberFormation,
hypothesisEquality,
isectElimination,
setEquality,
productEquality,
because_Cache,
productElimination,
lambdaEquality,
applyEquality,
independent_functionElimination,
lambdaFormation,
independent_pairEquality,
independent_isectElimination,
setElimination,
rename,
equalityTransitivity,
equalitySymmetry,
dependent_set_memberEquality,
unionEquality,
instantiate,
cumulativity,
universeEquality,
hyp_replacement,
applyLambdaEquality,
dependent_pairFormation,
independent_pairFormation,
imageMemberEquality,
baseClosed,
imageElimination,
natural_numberEquality
Latex:
\mforall{}[I:fset(\mBbbN{})]. \mforall{}[phi:\mBbbF{}(I)]. \mforall{}[u:\{I,phi \mvdash{} \_:\mBbbF{}\}]. (extend-face-term(I;phi;u) \mmember{} \mBbbF{}(I))
Date html generated:
2017_10_05-AM-07_32_43
Last ObjectModification:
2017_03_03-AM-00_54_06
Theory : cubical!type!theory
Home
Index