Step
*
1
1
of Lemma
formal-sum-add_functionality
1. S : Type
2. K : RngSig
3. x : basic-formal-sum(K;S)
4. x' : basic-formal-sum(K;S)
5. y : basic-formal-sum(K;S)
6. bfs-equiv(K;S;x;x')
7. x1 : basic-formal-sum(K;S)
8. y@0 : basic-formal-sum(K;S)
9. bfs-reduce(K;S;x1;y@0)
⊢ bfs-equiv(K;S;x1 + y;y@0 + y)
BY
{ (BLemma `implies-bfs-equiv` THEN Auto) }
1
1. S : Type
2. K : RngSig
3. x : basic-formal-sum(K;S)
4. x' : basic-formal-sum(K;S)
5. y : basic-formal-sum(K;S)
6. bfs-equiv(K;S;x;x')
7. x1 : basic-formal-sum(K;S)
8. y@0 : basic-formal-sum(K;S)
9. bfs-reduce(K;S;x1;y@0)
⊢ bfs-reduce(K;S;x1 + y;y@0 + y)
Latex:
Latex:
1. S : Type
2. K : RngSig
3. x : basic-formal-sum(K;S)
4. x' : basic-formal-sum(K;S)
5. y : basic-formal-sum(K;S)
6. bfs-equiv(K;S;x;x')
7. x1 : basic-formal-sum(K;S)
8. y@0 : basic-formal-sum(K;S)
9. bfs-reduce(K;S;x1;y@0)
\mvdash{} bfs-equiv(K;S;x1 + y;y@0 + y)
By
Latex:
(BLemma `implies-bfs-equiv` THEN Auto)
Home
Index