Nuprl Lemma : trivial-member-add-name1
∀I:fset(ℕ). ∀i:ℕ. i ∈ I+i
Proof
Definitions occuring in Statement :
add-name: I+i,
fset-member: a ∈ s,
fset: fset(T),
int-deq: IntDeq,
nat: ℕ,
all: ∀x:A. B[x]
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
or: P ∨ Q,
nat: ℕ,
prop: ℙ,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B
Lemmas referenced :
fset-member-add-name,
fset-member_wf,
nat_wf,
int-deq_wf,
fset_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
lemma_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
hypothesisEquality,
because_Cache,
productElimination,
independent_isectElimination,
inlFormation,
setElimination,
rename,
isectElimination,
hypothesis,
applyEquality,
sqequalRule
Latex:
\mforall{}I:fset(\mBbbN{}). \mforall{}i:\mBbbN{}. i \mmember{} I+i
Date html generated:
2016_05_18-PM-00_00_04
Last ObjectModification:
2015_12_28-PM-03_06_38
Theory : cubical!type!theory
Home
Index