Step
*
1
1
of Lemma
simple-finite-cantor-decider_wf
.....equality.....
1. T : Type
2. R : T ⟶ ℙ
3. dcdr : ∀x:T. Dec(R[x])
4. n : ℕ
5. F : (ℕn ⟶ 𝔹) ⟶ T
⊢ λdcdr,n,F. FiniteCantorDecide(dcdr;n;F) ~ TERMOF{simple-decidable-finite-cantor-ext:o, \\v:l, i:l}
BY
{ TACTIC:(RW (AddrC [2] (TagC (mk_tag_term 1))) 0 THEN Auto) }
Latex:
Latex:
.....equality.....
1. T : Type
2. R : T {}\mrightarrow{} \mBbbP{}
3. dcdr : \mforall{}x:T. Dec(R[x])
4. n : \mBbbN{}
5. F : (\mBbbN{}n {}\mrightarrow{} \mBbbB{}) {}\mrightarrow{} T
\mvdash{} \mlambda{}dcdr,n,F. FiniteCantorDecide(dcdr;n;F) \msim{} TERMOF\{simple-decidable-finite-cantor-ext:o, \mbackslash{}\mbackslash{}v:l, i:l\}
By
Latex:
TACTIC:(RW (AddrC [2] (TagC (mk\_tag\_term 1))) 0 THEN Auto)
Home
Index