Nuprl Lemma : nc-e'-lemma6
∀[I,J,K:fset(ℕ)]. ∀[f:J ⟶ I]. ∀[g:K ⟶ J]. ∀[z,v,j:ℕ]. f,z=j ⋅ g,j=v = f ⋅ g,z=v ∈ K+v ⟶ I+z supposing ¬j ∈ J
Proof
Definitions occuring in Statement :
nc-e': g,i=j,
add-name: I+i,
nh-comp: g ⋅ f,
names-hom: I ⟶ J,
fset-member: a ∈ s,
fset: fset(T),
nat-deq: NatDeq,
nat: ℕ,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
names-hom: I ⟶ J,
top: Top,
compose: f o g,
nc-e': g,i=j,
names: names(I),
nat: ℕ,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
squash: ↓T,
prop: ℙ,
subtype_rel: A ⊆r B,
DeMorgan-algebra: DeMorganAlgebra,
so_lambda: λ2x.t[x],
guard: {T},
so_apply: x[s],
true: True,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
false: False,
nequal: a ≠ b ∈ T ,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
dma-hom: dma-hom(dma1;dma2),
bounded-lattice-hom: Hom(l1;l2),
lattice-hom: Hom(l1;l2),
sq_stable: SqStable(P),
nat-deq: NatDeq,
int-deq: IntDeq
Lemmas referenced :
nh-comp-sq,
eq_int_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_int,
equal_wf,
squash_wf,
true_wf,
lattice-point_wf,
dM_wf,
add-name_wf,
subtype_rel_set,
DeMorgan-algebra-structure_wf,
lattice-structure_wf,
lattice-axioms_wf,
bounded-lattice-structure-subtype,
DeMorgan-algebra-structure-subtype,
subtype_rel_transitivity,
bounded-lattice-structure_wf,
bounded-lattice-axioms_wf,
uall_wf,
lattice-meet_wf,
lattice-join_wf,
DeMorgan-algebra-axioms_wf,
dM-lift-inc,
nc-e'_wf,
trivial-member-add-name1,
fset-member_wf,
nat_wf,
int-deq_wf,
strong-subtype-deq-subtype,
strong-subtype-set3,
le_wf,
strong-subtype-self,
dM_inc_wf,
iff_weakening_equal,
eqff_to_assert,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_int,
not-added-name,
names_wf,
not_wf,
nat-deq_wf,
names-hom_wf,
fset_wf,
nat_properties,
satisfiable-full-omega-tt,
intformnot_wf,
intformeq_wf,
itermVar_wf,
int_formula_prop_not_lemma,
int_formula_prop_eq_lemma,
int_term_value_var_lemma,
int_formula_prop_wf,
dM-subobject,
f-subset-add-name,
dM-dM-homs-equal,
compose-dma-hom,
dM-lift_wf,
all_wf,
names-subtype,
dM-point-subtype,
int_subtype_base,
sq_stable__fset-member
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
functionExtensionality,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
setElimination,
rename,
hypothesisEquality,
lambdaFormation,
unionElimination,
equalityElimination,
equalityTransitivity,
equalitySymmetry,
productElimination,
independent_isectElimination,
applyEquality,
lambdaEquality,
imageElimination,
universeEquality,
instantiate,
productEquality,
cumulativity,
because_Cache,
dependent_functionElimination,
dependent_set_memberEquality,
intEquality,
natural_numberEquality,
imageMemberEquality,
baseClosed,
independent_functionElimination,
dependent_pairFormation,
promote_hyp,
axiomEquality,
int_eqEquality,
computeAll,
setEquality,
applyLambdaEquality
Latex:
\mforall{}[I,J,K:fset(\mBbbN{})]. \mforall{}[f:J {}\mrightarrow{} I]. \mforall{}[g:K {}\mrightarrow{} J]. \mforall{}[z,v,j:\mBbbN{}]. f,z=j \mcdot{} g,j=v = f \mcdot{} g,z=v supposing \mneg{}j \mmember{} J
Date html generated:
2017_10_05-AM-01_05_38
Last ObjectModification:
2017_07_28-AM-09_27_29
Theory : cubical!type!theory
Home
Index