Step
*
2
1
of Lemma
l_find_wf
1. T : Type
2. u : T
3. v : T List
4. ∀[P:{x:T| (x ∈ v)} ⟶ 𝔹]
(l_find(v;P) ∈ (∃x:T [(∃i:ℕ||v||. ((x = v[i] ∈ T) ∧ (↑(P x)) ∧ (∀j:ℕi. (¬↑(P v[j])))))])
∨ (↓∀i:ℕ||v||. (¬↑(P v[i]))))
5. P : {x:T| (x ∈ [u / v])} ⟶ 𝔹
6. ¬↑(P u)
7. l_find(v;P) ∈ (∃x:T [(∃i:ℕ||v||. ((x = v[i] ∈ T) ∧ (↑(P x)) ∧ (∀j:ℕi. (¬↑(P v[j])))))]) ∨ (↓∀i:ℕ||v||. (¬↑(P v[i])))
⊢ l_find(v;P) ∈ (∃x:T [(∃i:ℕ||v||. ((x = v[i] ∈ T) ∧ (↑(P x)) ∧ (∀j:ℕi. (¬↑(P v[j])))))]) ∨ (↓∀i:ℕ||v||. (¬↑(P v[i])))
BY
{ Auto }
Latex:
Latex:
1. T : Type
2. u : T
3. v : T List
4. \mforall{}[P:\{x:T| (x \mmember{} v)\} {}\mrightarrow{} \mBbbB{}]
(l\_find(v;P) \mmember{} (\mexists{}x:T [(\mexists{}i:\mBbbN{}||v||. ((x = v[i]) \mwedge{} (\muparrow{}(P x)) \mwedge{} (\mforall{}j:\mBbbN{}i. (\mneg{}\muparrow{}(P v[j])))))])
\mvee{} (\mdownarrow{}\mforall{}i:\mBbbN{}||v||. (\mneg{}\muparrow{}(P v[i]))))
5. P : \{x:T| (x \mmember{} [u / v])\} {}\mrightarrow{} \mBbbB{}
6. \mneg{}\muparrow{}(P u)
7. l\_find(v;P) \mmember{} (\mexists{}x:T [(\mexists{}i:\mBbbN{}||v||. ((x = v[i]) \mwedge{} (\muparrow{}(P x)) \mwedge{} (\mforall{}j:\mBbbN{}i. (\mneg{}\muparrow{}(P v[j])))))])
\mvee{} (\mdownarrow{}\mforall{}i:\mBbbN{}||v||. (\mneg{}\muparrow{}(P v[i])))
\mvdash{} l\_find(v;P) \mmember{} (\mexists{}x:T [(\mexists{}i:\mBbbN{}||v||. ((x = v[i]) \mwedge{} (\muparrow{}(P x)) \mwedge{} (\mforall{}j:\mBbbN{}i. (\mneg{}\muparrow{}(P v[j])))))])
\mvee{} (\mdownarrow{}\mforall{}i:\mBbbN{}||v||. (\mneg{}\muparrow{}(P v[i])))
By
Latex:
Auto
Home
Index