Theorems · Theorem · logic and foundations
Computation.mem_unique
∀ {α : Type u} {s : Computation α} {a b : α}, a ∈ s → b ∈ s → a = b- Defined in
- Mathlib.Data.Seq.Computation
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- le_max_leftproof · cited by 215
- le_max_rightproof · cited by 205
- Computationstatement and proof · cited by 182
- Stream'.getproof · cited by 86
- Computation.le_stableproof · cited by 1
Cited by15
Results whose statement or proof uses this declaration.
- Computation.get_eq_of_memproof · cited by 9
- Computation.exists_of_mem_mapproof · cited by 6
- Computation.eq_of_pure_memproof · cited by 4
- Computation.equiv_of_memproof · cited by 1
- Stream'.WSeq.destruct_some_of_destruct_tail_someproof · cited by 1
- Computation.LiftRelAux.ret_leftproof · cited by 1
- Computation.liftRel_defproof · cited by 1
- Computation.liftRel_pure_leftproof · cited by 1
- Stream'.WSeq.Equiv.extproof · cited by 0
- Computation.rel_of_liftRelproof · cited by 0
- Computation.mem_promisesproof · cited by 0
- Computation.Mem.left_uniqueproof · cited by 0