Instances For
Dependency graph
@[instance_reducible]
instance
instDecidableRelProdLEByKey
{α : Type}
[LinearOrder α]
{β : Type u_1}
:
DecidableRel fun (a b : α × β) => LEByKey a b
Equations
- instDecidableRelProdLEByKey a b = if h : a.1 ≤ b.1 then isTrue h else isFalse h
Dependency graph
Dependency graph
Dependency graph
Equations
- KeyValueList [] = True
- KeyValueList [hd'] = (KeyValueList [] ∧ True)
- KeyValueList (hd' :: hd'_1 :: tail_1) = (KeyValueList (hd'_1 :: tail_1) ∧ hd'.1 < hd'_1.1)
Instances For
Dependency graph
def
List.addKV
{α : Type}
[LinearOrder α]
{β : Type u_1}
[DecidableEq β]
[Add β]
(l : List (α × β))
(a : α)
(b : β)
:
Equations
- One or more equations did not get rendered due to their size.
Instances For
Dependency graph
theorem
KeyValueList.addKV
{α : Type}
[LinearOrder α]
{β : Type u_1}
[DecidableEq β]
[Add β]
(l : List (α × β))
(h : KeyValueList l)
(a : α)
(b : β)
:
KeyValueList (l.addKV a b)
Dependency graph
def
KeyValueList.addKVFold
{α : Type}
[LinearOrder α]
{β : Type u_1}
[DecidableEq β]
[Add β]
(ab : α × β)
(l : { l : List (α × β) // KeyValueList l })
:
Equations
- KeyValueList.addKVFold ab l = ⟨(↑l).addKV ab.1 ab.2, ⋯⟩
Instances For
Dependency graph
instance
instLeftCommutativeProdSubtypeListKeyValueListAddKVFold
{α : Type}
[LinearOrder α]
{β : Type u_1}
[DecidableEq β]
[AddCommSemigroup β]
: