Step
*
of Lemma
decidable__l_exists
∀[A:Type]. ∀[F:A ⟶ ℙ]. ∀L:A List. ((∀k:A. Dec(F[k]))
⇒ Dec((∃k∈L. F[k])))
BY
{ xxxExtract of Obid: decidable__l_exists-proof
not unfolding select length
finishing with xxx(Fold `l-exists-decider` 0 THEN Auto)xxx
normalizes to:
l-exists-decider()xxx }
Latex:
Latex:
\mforall{}[A:Type]. \mforall{}[F:A {}\mrightarrow{} \mBbbP{}]. \mforall{}L:A List. ((\mforall{}k:A. Dec(F[k])) {}\mRightarrow{} Dec((\mexists{}k\mmember{}L. F[k])))
By
Latex:
xxxExtract of Obid: decidable\_\_l\_exists-proof
not unfolding select length
finishing with xxx(Fold `l-exists-decider` 0 THEN Auto)xxx
normalizes to:
l-exists-decider()xxx
Home
Index