Step
*
2
1
1
of Lemma
rel-path-between-cons
1. [T] : Type
2. [R] : T ⟶ T ⟶ ℙ
3. L : T List
4. ¬(L = [] ∈ (T List))
5. x : T
6. y : T
7. z : T
8. ∀i:ℕ||[z / L]|| - 1. ([z / L][i] R [z / L][i + 1])
9. 0 < ||L|| + 1
10. x = z ∈ T
11. y = last([z / L]) ∈ T
12. ¬False
13. z R L[0]
⊢ x R hd(L)
BY
{ (NthHypEq (-1) THEN EqCD THEN Auto) }
Latex:
Latex:
1. [T] : Type
2. [R] : T {}\mrightarrow{} T {}\mrightarrow{} \mBbbP{}
3. L : T List
4. \mneg{}(L = [])
5. x : T
6. y : T
7. z : T
8. \mforall{}i:\mBbbN{}||[z / L]|| - 1. ([z / L][i] R [z / L][i + 1])
9. 0 < ||L|| + 1
10. x = z
11. y = last([z / L])
12. \mneg{}False
13. z R L[0]
\mvdash{} x R hd(L)
By
Latex:
(NthHypEq (-1) THEN EqCD THEN Auto)
Home
Index