Nuprl Lemma : empty-nat-missing-prop
∀x:ℕ. (¬↑member-nat-missing(x;empty-nat-missing()))
Proof
Definitions occuring in Statement :
empty-nat-missing: empty-nat-missing(),
member-nat-missing: member-nat-missing(i;s),
nat: ℕ,
assert: ↑b,
all: ∀x:A. B[x],
not: ¬A
Definitions unfolded in proof :
empty-nat-missing: empty-nat-missing(),
member-nat-missing: member-nat-missing(i;s),
all: ∀x:A. B[x],
not: ¬A,
implies: P ⇒ Q,
false: False,
and: P ∧ Q,
uall: ∀[x:A]. B[x],
member: t ∈ T,
nat: ℕ,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
prop: ℙ,
iff: P ⇐⇒ Q,
uiff: uiff(P;Q),
rev_implies: P ⇐ Q
Latex:
\mforall{}x:\mBbbN{}. (\mneg{}\muparrow{}member-nat-missing(x;empty-nat-missing()))
Date html generated:
2016_05_17-PM-01_45_02
Last ObjectModification:
2016_01_17-AM-11_37_15
Theory : datatype-signatures
Home
Index