Nuprl Lemma : the-member-bag-rep
∀[T:Type]. ∀[n:ℕ]. ∀[a:T]. a ↓∈ bag-rep(n;a) supposing 0 < n
Proof
Definitions occuring in Statement :
nat: ℕ,
less_than: a < b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
natural_number: $n,
universe: Type,
bag-member: x ↓∈ bs,
bag-rep: bag-rep(n;x)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
bag-rep: bag-rep(n;x),
nat: ℕ,
top: Top,
bag-member: x ↓∈ bs,
squash: ↓T,
prop: ℙ,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
all: ∀x:A. B[x],
and: P ∧ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
decidable: Dec(P),
or: P ∨ Q,
sq_or: a ↓∨ b,
rev_uimplies: rev_uimplies(P;Q)
Latex:
\mforall{}[T:Type]. \mforall{}[n:\mBbbN{}]. \mforall{}[a:T]. a \mdownarrow{}\mmember{} bag-rep(n;a) supposing 0 < n
Date html generated:
2016_05_17-AM-11_09_57
Last ObjectModification:
2016_01_18-AM-00_10_39
Theory : process-model
Home
Index