Nuprl Lemma : fsize_empty_lemma
∀eq:Top. (||{}|| ~ 0)
Proof
Definitions occuring in Statement :
fset-size: ||s||,
empty-fset: {},
top: Top,
all: ∀x:A. B[x],
natural_number: $n,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
fset-size: ||s||,
length: ||as||,
list_ind: list_ind,
remove-repeats: remove-repeats(eq;L),
empty-fset: {},
nil: [],
it: ⋅
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}eq:Top. (||\{\}|| \msim{} 0)
Date html generated:
2016_05_14-PM-03_45_47
Last ObjectModification:
2015_12_26-PM-06_37_37
Theory : finite!sets
Home
Index