Nuprl Lemma : debug2
∀m:ℤ. Dec(∀i:ℕm. 0 < i)
Proof
Definitions occuring in Statement :
int_seg: {i..j-},
less_than: a < b,
decidable: Dec(P),
all: ∀x:A. B[x],
natural_number: $n,
int: ℤ
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
int_seg: {i..j-},
so_apply: x[s],
implies: P ⇒ Q
Latex:
\mforall{}m:\mBbbZ{}. Dec(\mforall{}i:\mBbbN{}m. 0 < i)
Date html generated:
2016_05_17-PM-00_39_02
Last ObjectModification:
2015_12_29-PM-06_32_05
Theory : event-logic-applications
Home
Index