Nuprl Lemma : path-term-0
∀X:j⊢. ∀psi:{X ⊢ _:𝔽}. ∀T:{X ⊢ _}. ∀a,b:{X ⊢ _:T}. ∀w:{X, psi ⊢ _:(Path_T a b)}.
(path-term(psi;w;a;b;0(𝕀)) = a ∈ {X ⊢ _:T})
Proof
Definitions occuring in Statement :
path-term: path-term(phi;w;a;b;r),
path-type: (Path_A a b),
context-subset: Gamma, phi,
face-type: 𝔽,
interval-0: 0(𝕀),
cubical-term: {X ⊢ _:A},
cubical-type: {X ⊢ _},
cubical_set: CubicalSet,
all: ∀x:A. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
path-term: path-term(phi;w;a;b;r),
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
interval-0: 0(𝕀),
face-zero: (i=0),
case-term: (u ∨ v),
cubical-term-at: u(a),
ifthenelse: if b then t else f fi ,
btrue: tt,
dm-neg: ¬(x),
lattice-extend: lattice-extend(L;eq;eqL;f;ac),
lattice-fset-join: \/(s),
reduce: reduce(f;k;as),
list_ind: list_ind,
fset-image: f"(s),
f-union: f-union(domeq;rngeq;s;x.g[x]),
list_accum: list_accum,
dM0: 0,
lattice-0: 0,
record-select: r.x,
dM: dM(I),
free-DeMorgan-algebra: free-DeMorgan-algebra(T;eq),
mk-DeMorgan-algebra: mk-DeMorgan-algebra(L;n),
record-update: r[x := v],
eq_atom: x =a y,
bfalse: ff,
free-DeMorgan-lattice: free-DeMorgan-lattice(T;eq),
free-dist-lattice: free-dist-lattice(T; eq),
mk-bounded-distributive-lattice: mk-bounded-distributive-lattice,
mk-bounded-lattice: mk-bounded-lattice(T;m;j;z;o),
empty-fset: {},
nil: [],
it: ⋅,
opposite-lattice: opposite-lattice(L),
lattice-1: 1,
fset-singleton: {x},
cons: [a / b],
dM1: 1,
bdd-distributive-lattice: BoundedDistributiveLattice,
so_lambda: λ2x.t[x],
prop: ℙ,
and: P ∧ Q,
so_apply: x[s],
implies: P ⇒ Q,
assert: ↑b,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
true: True,
sq_type: SQType(T),
same-cubical-term: X ⊢ u=v:A,
squash: ↓T
Lemmas referenced :
cubical-path-app-0,
context-subset_wf,
thin-context-subset,
context-subset-term-subtype,
subset-cubical-term2,
sub_cubical_set_self,
path-type_wf,
subset-cubical-term,
context-subset-is-subset,
path-type-subset,
cubical-term_wf,
cubical-type-cumulativity2,
cubical_set_cumulativity-i-j,
cubical-type_wf,
face-type_wf,
cubical_set_wf,
I_cube_wf,
fset_wf,
nat_wf,
cubical-term-equal,
cubical-term-at_wf,
subtype_base_sq,
bool_wf,
bool_subtype_base,
iff_imp_equal_bool,
fl-eq_wf,
dM-to-FL_wf,
dM1_wf,
lattice-1_wf,
face_lattice_wf,
btrue_wf,
iff_functionality_wrt_iff,
assert_wf,
equal_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,
lattice-meet_wf,
lattice-join_wf,
true_wf,
iff_weakening_uiff,
assert-fl-eq,
iff_weakening_equal,
dM-to-FL-dM1,
istype-true,
case-term-same2,
face-1_wf,
equal_functionality_wrt_subtype_rel2,
face-or_wf,
sub_cubical_set_wf,
squash_wf,
face-or-1,
context-1-subset
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation_alt,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
applyEquality,
sqequalRule,
because_Cache,
independent_isectElimination,
Error :memTop,
universeIsType,
instantiate,
equalitySymmetry,
functionExtensionality,
equalityTransitivity,
cumulativity,
lambdaEquality_alt,
setElimination,
rename,
inhabitedIsType,
productEquality,
isectEquality,
independent_functionElimination,
productElimination,
independent_pairFormation,
natural_numberEquality,
equalityIstype,
dependent_functionElimination,
imageElimination,
imageMemberEquality,
baseClosed
Latex:
\mforall{}X:j\mvdash{}. \mforall{}psi:\{X \mvdash{} \_:\mBbbF{}\}. \mforall{}T:\{X \mvdash{} \_\}. \mforall{}a,b:\{X \mvdash{} \_:T\}. \mforall{}w:\{X, psi \mvdash{} \_:(Path\_T a b)\}.
(path-term(psi;w;a;b;0(\mBbbI{})) = a)
Date html generated:
2020_05_20-PM-05_10_01
Last ObjectModification:
2020_04_10-AM-11_41_57
Theory : cubical!type!theory
Home
Index