Step * 1 2 of Lemma sum-partial-has-value

.....subterm..... T:t
2:n
1. : ℕ@i
2. : ℕn ⟶ partial(ℕ)@i
⊢ ∀i:ℕn. (f[i])↓ supposing (f[x] x < n))↓ ∈ ℙ
BY
TACTIC:(InstLemma `sum-partial-nat` [⌜n⌝;⌜f⌝]⋅ THEN Auto) }


Latex:


Latex:
.....subterm.....  T:t
2:n
1.  n  :  \mBbbN{}@i
2.  f  :  \mBbbN{}n  {}\mrightarrow{}  partial(\mBbbN{})@i
\mvdash{}  \mforall{}i:\mBbbN{}n.  (f[i])\mdownarrow{}  supposing  (\mSigma{}(f[x]  |  x  <  n))\mdownarrow{}  \mmember{}  \mBbbP{}


By


Latex:
TACTIC:(InstLemma  `sum-partial-nat`  [\mkleeneopen{}n\mkleeneclose{};\mkleeneopen{}f\mkleeneclose{}]\mcdot{}  THEN  Auto)




Home Index