|
1 | 1 | import kdrag as kd |
2 | | -import kdrag.theories.real as R |
| 2 | +import kdrag.theories.real as real |
3 | 3 | import kdrag.smt as smt |
4 | 4 |
|
5 | 5 | """ |
|
13 | 13 |
|
14 | 14 | kd.notation.getitem.register(Interval, lambda a, idx: setof(a)[idx]) |
15 | 15 |
|
16 | | -meet = kd.define("meet", [i, j], Interval.mk(R.max(i.lo, j.lo), R.min(i.hi, j.hi))) |
| 16 | +meet = kd.define("meet", [i, j], Interval.mk(real.max(i.lo, j.lo), real.min(i.hi, j.hi))) |
17 | 17 | meet_intersect = kd.prove( |
18 | 18 | smt.ForAll([i, j], smt.SetIntersect(setof(i), setof(j)) == setof(meet(i, j))), |
19 | | - by=[setof.defn, meet.defn, R.min.defn, R.max.defn], |
| 19 | + by=[setof.defn, meet.defn, real.min.defn, real.max.defn], |
20 | 20 | ) |
21 | 21 | kd.notation.and_.register(Interval, meet) |
22 | 22 |
|
23 | | -join = kd.define("join", [i, j], Interval.mk(R.min(i.lo, j.lo), R.max(i.hi, j.hi))) |
| 23 | +join = kd.define("join", [i, j], Interval.mk(real.min(i.lo, j.lo), real.max(i.hi, j.hi))) |
24 | 24 | join_union = kd.prove( |
25 | 25 | smt.ForAll( |
26 | 26 | [i, j], smt.IsSubset(smt.SetUnion(setof(i), setof(j)), setof(join(i, j))) |
27 | 27 | ), |
28 | | - by=[setof.defn, join.defn, R.min.defn, R.max.defn], |
| 28 | + by=[setof.defn, join.defn, real.min.defn, real.max.defn], |
29 | 29 | ) |
30 | 30 | kd.notation.or_.register(Interval, join) |
31 | 31 |
|
|
0 commit comments