Nuprl Lemma : composition-uniformity_wf
∀[Gamma:j⊢]. ∀[A:{Gamma ⊢ _}]. ∀[comp:I:fset(ℕ)
                                      ⟶ i:{i:ℕ| ¬i ∈ I} 
                                      ⟶ rho:Gamma(I+i)
                                      ⟶ phi:𝔽(I)
                                      ⟶ u:{I+i,s(phi) ⊢ _:(A)<rho> o iota}
                                      ⟶ cubical-path-0(Gamma;A;I;i;rho;phi;u)
                                      ⟶ cubical-path-1(Gamma;A;I;i;rho;phi;u)].
  (composition-uniformity(Gamma;A;comp) ∈ ℙ{[i' | j']})
Proof
Definitions occuring in Statement : 
composition-uniformity: composition-uniformity(Gamma;A;comp)
, 
cubical-path-1: cubical-path-1(Gamma;A;I;i;rho;phi;u)
, 
cubical-path-0: cubical-path-0(Gamma;A;I;i;rho;phi;u)
, 
cubical-term: {X ⊢ _:A}
, 
csm-ap-type: (AF)s
, 
cubical-type: {X ⊢ _}
, 
subset-iota: iota
, 
cubical-subset: I,psi
, 
face-presheaf: 𝔽
, 
csm-comp: G o F
, 
context-map: <rho>
, 
formal-cube: formal-cube(I)
, 
cube-set-restriction: f(s)
, 
I_cube: A(I)
, 
cubical_set: CubicalSet
, 
nc-s: s
, 
add-name: I+i
, 
fset-member: a ∈ s
, 
fset: fset(T)
, 
int-deq: IntDeq
, 
nat: ℕ
, 
uall: ∀[x:A]. B[x]
, 
prop: ℙ
, 
not: ¬A
, 
member: t ∈ T
, 
set: {x:A| B[x]} 
, 
function: x:A ⟶ B[x]
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
composition-uniformity: composition-uniformity(Gamma;A;comp)
, 
so_lambda: λ2x.t[x]
, 
subtype_rel: A ⊆r B
, 
prop: ℙ
, 
nat: ℕ
, 
ge: i ≥ j 
, 
all: ∀x:A. B[x]
, 
decidable: Dec(P)
, 
or: P ∨ Q
, 
uimplies: b supposing a
, 
not: ¬A
, 
implies: P 
⇒ Q
, 
satisfiable_int_formula: satisfiable_int_formula(fmla)
, 
exists: ∃x:A. B[x]
, 
false: False
, 
and: P ∧ Q
, 
so_apply: x[s]
, 
true: True
, 
squash: ↓T
, 
guard: {T}
, 
iff: P 
⇐⇒ Q
, 
rev_implies: P 
⇐ Q
, 
cubical-path-1: cubical-path-1(Gamma;A;I;i;rho;phi;u)
Lemmas referenced : 
all_wf, 
fset_wf, 
nat_wf, 
not_wf, 
fset-member_wf, 
int-deq_wf, 
names-hom_wf, 
I_cube_wf, 
add-name_wf, 
nat_properties, 
decidable__le, 
full-omega-unsat, 
intformand_wf, 
intformnot_wf, 
intformle_wf, 
itermConstant_wf, 
itermVar_wf, 
istype-int, 
int_formula_prop_and_lemma, 
int_formula_prop_not_lemma, 
int_formula_prop_le_lemma, 
int_term_value_constant_lemma, 
int_term_value_var_lemma, 
int_formula_prop_wf, 
istype-le, 
face-presheaf_wf2, 
cubical-term_wf, 
cubical-subset_wf, 
cube-set-restriction_wf, 
nc-s_wf, 
f-subset-add-name, 
csm-ap-type_wf, 
cubical_set_cumulativity-i-j, 
csm-comp_wf, 
formal-cube_wf1, 
subset-iota_wf, 
context-map_wf, 
cubical-path-0_wf, 
cubical-type-cumulativity2, 
cubical-type-cumulativity, 
istype-void, 
istype-nat, 
strong-subtype-deq-subtype, 
strong-subtype-set3, 
le_wf, 
strong-subtype-self, 
cubical-path-1_wf, 
cubical-type_wf, 
cubical_set_wf, 
nc-e'_wf, 
squash_wf, 
true_wf, 
nc-e'-lemma3, 
equal_wf, 
istype-universe, 
fl-morph-restriction, 
cube-set-restriction-comp, 
subtype_rel_self, 
iff_weakening_equal, 
cubical-subset-term-trans, 
cubical-type-at_wf, 
nc-1_wf, 
cubical-type-ap-morph_wf, 
cubical-path-0-ap-morph, 
subtype_rel_set, 
cubical-path-condition'_wf, 
istype-cubical-type-at, 
subtype_rel-equal, 
nh-comp_wf, 
nc-e'-lemma1
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation_alt, 
introduction, 
cut, 
thin, 
instantiate, 
extract_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
cumulativity, 
hypothesis, 
sqequalRule, 
lambdaEquality_alt, 
because_Cache, 
setEquality, 
applyEquality, 
hypothesisEquality, 
dependent_set_memberEquality_alt, 
setElimination, 
rename, 
dependent_functionElimination, 
natural_numberEquality, 
unionElimination, 
independent_isectElimination, 
approximateComputation, 
independent_functionElimination, 
dependent_pairFormation_alt, 
int_eqEquality, 
Error :memTop, 
independent_pairFormation, 
universeIsType, 
voidElimination, 
universeEquality, 
equalityTransitivity, 
equalitySymmetry, 
setIsType, 
functionIsType, 
axiomEquality, 
intEquality, 
isect_memberEquality_alt, 
isectIsTypeImplies, 
inhabitedIsType, 
imageElimination, 
imageMemberEquality, 
baseClosed, 
productElimination
Latex:
\mforall{}[Gamma:j\mvdash{}].  \mforall{}[A:\{Gamma  \mvdash{}  \_\}].  \mforall{}[comp:I:fset(\mBbbN{})
                                                                            {}\mrightarrow{}  i:\{i:\mBbbN{}|  \mneg{}i  \mmember{}  I\} 
                                                                            {}\mrightarrow{}  rho:Gamma(I+i)
                                                                            {}\mrightarrow{}  phi:\mBbbF{}(I)
                                                                            {}\mrightarrow{}  u:\{I+i,s(phi)  \mvdash{}  \_:(A)<rho>  o  iota\}
                                                                            {}\mrightarrow{}  cubical-path-0(Gamma;A;I;i;rho;phi;u)
                                                                            {}\mrightarrow{}  cubical-path-1(Gamma;A;I;i;rho;phi;u)].
    (composition-uniformity(Gamma;A;comp)  \mmember{}  \mBbbP{}\{[i'  |  j']\})
Date html generated:
2020_05_20-PM-03_48_55
Last ObjectModification:
2020_04_09-AM-11_34_28
Theory : cubical!type!theory
Home
Index