Nuprl Lemma : case-endpoints-1
∀[G:j⊢]. ∀[A:{G ⊢ _}]. ∀[a:Top]. ∀[b:{G ⊢ _:A}]. ([1(𝕀)=0 ⊢→ a; 1(𝕀)=1 ⊢→ b] = b ∈ {G ⊢ _:A})
Proof
Definitions occuring in Statement :
case-endpoints: [r=0 ⊢→ a; r=1 ⊢→ b],
interval-1: 1(𝕀),
cubical-term: {X ⊢ _:A},
cubical-type: {X ⊢ _},
cubical_set: CubicalSet,
uall: ∀[x:A]. B[x],
top: Top,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
case-endpoints: [r=0 ⊢→ a; r=1 ⊢→ b],
case-term: (u ∨ v),
member: t ∈ T,
uimplies: b supposing a,
sq_type: SQType(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
guard: {T},
cubical-term: {X ⊢ _:A},
ifthenelse: if b then t else f fi ,
bfalse: ff,
cubical-term-at: u(a),
subtype_rel: A ⊆r B,
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],
eq_atom: x =a y,
btrue: tt,
bool: 𝔹,
unit: Unit,
it: ⋅,
uiff: uiff(P;Q),
and: P ∧ Q,
bdd-distributive-lattice: BoundedDistributiveLattice,
so_lambda: λ2x.t[x],
prop: ℙ,
so_apply: x[s],
exists: ∃x:A. B[x],
or: P ∨ Q,
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
rev_implies: P ⇐ Q,
iff: P ⇐⇒ Q,
interval-1: 1(𝕀),
face-zero: (i=0),
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,
dM1: 1,
lattice-1: 1,
dM: dM(I),
free-DeMorgan-algebra: free-DeMorgan-algebra(T;eq),
mk-DeMorgan-algebra: mk-DeMorgan-algebra(L;n),
free-DeMorgan-lattice: free-DeMorgan-lattice(T;eq),
free-dist-lattice: free-dist-lattice(T; eq),
fset-singleton: {x},
cons: [a / b],
nil: [],
fset-union: x ⋃ y,
l-union: as ⋃ bs,
insert: insert(a;L),
eval_list: eval_list(t),
deq-member: x ∈b L,
lattice-join: a ∨ b,
opposite-lattice: opposite-lattice(L),
so_lambda: λ2x y.t[x; y],
lattice-meet: a ∧ b,
fset-ac-glb: fset-ac-glb(eq;ac1;ac2),
fset-minimals: fset-minimals(x,y.less[x; y]; s),
fset-filter: {x ∈ s | P[x]},
filter: filter(P;l),
lattice-fset-meet: /\(s),
empty-fset: {},
lattice-0: 0,
dM0: 0,
squash: ↓T,
true: True
Lemmas referenced :
subtype_base_sq,
bool_wf,
bool_subtype_base,
I_cube_wf,
fset_wf,
nat_wf,
cubical-term-equal,
cubical-term_wf,
cubical-type-cumulativity2,
cubical_set_cumulativity-i-j,
istype-top,
cubical-type_wf,
cubical_set_wf,
fl-eq_wf,
cubical-term-at_wf,
face-type_wf,
face-zero_wf,
interval-1_wf,
subtype_rel_self,
lattice-point_wf,
face_lattice_wf,
lattice-1_wf,
eqtt_to_assert,
assert-fl-eq,
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,
eqff_to_assert,
bool_cases_sqequal,
assert-bnot,
iff_weakening_uiff,
assert_wf,
bfalse_wf,
squash_wf,
true_wf,
istype-universe,
dM-to-FL-dM0,
iff_weakening_equal,
face-lattice-0-not-1
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
equalitySymmetry,
cut,
functionExtensionality,
sqequalRule,
thin,
instantiate,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
cumulativity,
hypothesis,
independent_isectElimination,
dependent_functionElimination,
equalityTransitivity,
independent_functionElimination,
applyEquality,
setElimination,
rename,
hypothesisEquality,
universeIsType,
because_Cache,
inhabitedIsType,
lambdaFormation_alt,
unionElimination,
equalityElimination,
productElimination,
lambdaEquality_alt,
productEquality,
isectEquality,
dependent_pairFormation_alt,
equalityIstype,
promote_hyp,
voidElimination,
imageElimination,
universeEquality,
natural_numberEquality,
imageMemberEquality,
baseClosed
Latex:
\mforall{}[G:j\mvdash{}]. \mforall{}[A:\{G \mvdash{} \_\}]. \mforall{}[a:Top]. \mforall{}[b:\{G \mvdash{} \_:A\}]. ([1(\mBbbI{})=0 \mvdash{}\mrightarrow{} a; 1(\mBbbI{})=1 \mvdash{}\mrightarrow{} b] = b)
Date html generated:
2020_05_20-PM-04_15_49
Last ObjectModification:
2020_04_10-AM-04_46_53
Theory : cubical!type!theory
Home
Index