Step
*
2
1
of Lemma
formal-sum-mul-mul
.....antecedent.....
1. S : Type
2. K : CRng
3. k : |K|
4. b : |K|
5. ∀[x:basic-formal-sum(K;S)]. (k * b * x = k * b * x ∈ basic-formal-sum(K;S))
6. x : Base
7. x1 : Base
8. x = x1 ∈ pertype(λa,b. ((a ∈ basic-formal-sum(K;S)) ∧ (b ∈ basic-formal-sum(K;S)) ∧ bfs-equiv(K;S;a;b)))
9. x ∈ basic-formal-sum(K;S)
10. x1 ∈ basic-formal-sum(K;S)
11. bfs-equiv(K;S;x;x1)
⊢ bfs-equiv(K;S;k * b * x;k * b * x1)
BY
{ ((RWO "5" 0 THENA Auto) THEN BLemma `formal-sum-mul_functionality` THEN Auto) }
Latex:
Latex:
.....antecedent.....
1. S : Type
2. K : CRng
3. k : |K|
4. b : |K|
5. \mforall{}[x:basic-formal-sum(K;S)]. (k * b * x = k * b * x)
6. x : Base
7. x1 : Base
8. x = x1
9. x \mmember{} basic-formal-sum(K;S)
10. x1 \mmember{} basic-formal-sum(K;S)
11. bfs-equiv(K;S;x;x1)
\mvdash{} bfs-equiv(K;S;k * b * x;k * b * x1)
By
Latex:
((RWO "5" 0 THENA Auto) THEN BLemma `formal-sum-mul\_functionality` THEN Auto)
Home
Index