Step
*
2
of Lemma
compat-append
1. [T] : Type
2. u : T@i
3. v : T List@i
4. ∀cs,bs,ds:T List. (v @ bs || cs @ ds
⇒ v || cs)@i
⊢ ∀cs,bs,ds:T List. ([u / v] @ bs || cs @ ds
⇒ [u / v] || cs)
BY
{ InductionOnList }
1
1. [T] : Type
2. u : T@i
3. v : T List@i
4. ∀cs,bs,ds:T List. (v @ bs || cs @ ds
⇒ v || cs)@i
⊢ ∀bs,ds:T List. ([u / v] @ bs || [] @ ds
⇒ [u / v] || [])
2
1. [T] : Type
2. u : T@i
3. v : T List@i
4. ∀cs,bs,ds:T List. (v @ bs || cs @ ds
⇒ v || cs)@i
5. u1 : T@i
6. v1 : T List@i
7. ∀bs,ds:T List. ([u / v] @ bs || v1 @ ds
⇒ [u / v] || v1)@i
⊢ ∀bs,ds:T List. ([u / v] @ bs || [u1 / v1] @ ds
⇒ [u / v] || [u1 / v1])
Latex:
Latex:
1. [T] : Type
2. u : T@i
3. v : T List@i
4. \mforall{}cs,bs,ds:T List. (v @ bs || cs @ ds {}\mRightarrow{} v || cs)@i
\mvdash{} \mforall{}cs,bs,ds:T List. ([u / v] @ bs || cs @ ds {}\mRightarrow{} [u / v] || cs)
By
Latex:
InductionOnList
Home
Index