Nuprl Lemma : nc-e'_wf
∀[I,J:fset(ℕ)]. ∀[i,j:ℕ]. ∀[g:J ⟶ I].  (g,i=j ∈ J+j ⟶ I+i)
Proof
Definitions occuring in Statement : 
nc-e': g,i=j
, 
add-name: I+i
, 
names-hom: I ⟶ J
, 
fset: fset(T)
, 
nat: ℕ
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
nc-e': g,i=j
, 
names-hom: I ⟶ J
, 
names: names(I)
, 
nat: ℕ
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
bool: 𝔹
, 
unit: Unit
, 
it: ⋅
, 
btrue: tt
, 
ifthenelse: if b then t else f fi 
, 
uiff: uiff(P;Q)
, 
and: P ∧ Q
, 
uimplies: b supposing a
, 
subtype_rel: A ⊆r B
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
prop: ℙ
, 
bfalse: ff
, 
exists: ∃x:A. B[x]
, 
or: P ∨ Q
, 
sq_type: SQType(T)
, 
guard: {T}
, 
bnot: ¬bb
, 
assert: ↑b
, 
false: False
Lemmas referenced : 
names_wf, 
add-name_wf, 
names-hom_wf, 
nat_wf, 
fset_wf, 
eq_int_wf, 
bool_wf, 
eqtt_to_assert, 
assert_of_eq_int, 
dM_inc_wf, 
trivial-member-add-name1, 
fset-member_wf, 
int-deq_wf, 
strong-subtype-deq-subtype, 
strong-subtype-set3, 
le_wf, 
strong-subtype-self, 
eqff_to_assert, 
equal_wf, 
bool_cases_sqequal, 
subtype_base_sq, 
bool_subtype_base, 
assert-bnot, 
neg_assert_of_eq_int, 
not-added-name, 
dM-point-subtype, 
f-subset-add-name
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
sqequalHypSubstitution, 
functionExtensionality, 
sqequalRule, 
extract_by_obid, 
isectElimination, 
thin, 
hypothesisEquality, 
hypothesis, 
axiomEquality, 
equalityTransitivity, 
equalitySymmetry, 
isect_memberEquality, 
because_Cache, 
setElimination, 
rename, 
lambdaFormation, 
unionElimination, 
equalityElimination, 
productElimination, 
independent_isectElimination, 
dependent_functionElimination, 
dependent_set_memberEquality, 
applyEquality, 
intEquality, 
lambdaEquality, 
natural_numberEquality, 
dependent_pairFormation, 
promote_hyp, 
instantiate, 
cumulativity, 
independent_functionElimination, 
voidElimination
Latex:
\mforall{}[I,J:fset(\mBbbN{})].  \mforall{}[i,j:\mBbbN{}].  \mforall{}[g:J  {}\mrightarrow{}  I].    (g,i=j  \mmember{}  J+j  {}\mrightarrow{}  I+i)
Date html generated:
2017_10_05-AM-01_03_55
Last ObjectModification:
2017_07_28-AM-09_26_52
Theory : cubical!type!theory
Home
Index