@[simp]
theorem
Std.Rcc.toList_iter_eq_toList
{α : Type u_1}
[LE α]
[DecidableLE α]
[PRange.UpwardEnumerable α]
[PRange.LawfulUpwardEnumerableLE α]
[Rxc.IsAlwaysFinite α]
[PRange.LawfulUpwardEnumerable α]
{r : Rcc α}
:
@[simp]
theorem
Std.Rco.toList_iter_eq_toList
{α : Type u_1}
[LT α]
[DecidableLT α]
[PRange.UpwardEnumerable α]
[PRange.LawfulUpwardEnumerableLT α]
[Rxo.IsAlwaysFinite α]
[PRange.LawfulUpwardEnumerable α]
{r : Rco α}
:
@[simp]
theorem
Std.Rci.toList_iter_eq_toList
{α : Type u_1}
[PRange.UpwardEnumerable α]
[Rxi.IsAlwaysFinite α]
[PRange.LawfulUpwardEnumerable α]
{r : Rci α}
:
@[simp]
theorem
Std.Roc.toList_iter_eq_toList
{α : Type u_1}
[LE α]
[DecidableLE α]
[PRange.UpwardEnumerable α]
[PRange.LawfulUpwardEnumerableLE α]
[Rxc.IsAlwaysFinite α]
[PRange.LawfulUpwardEnumerable α]
{r : Roc α}
:
@[simp]
theorem
Std.Roo.toList_iter_eq_toList
{α : Type u_1}
[LT α]
[DecidableLT α]
[PRange.UpwardEnumerable α]
[PRange.LawfulUpwardEnumerableLT α]
[Rxo.IsAlwaysFinite α]
[PRange.LawfulUpwardEnumerable α]
{r : Roo α}
:
@[simp]
theorem
Std.Roi.toList_iter_eq_toList
{α : Type u_1}
[PRange.UpwardEnumerable α]
[Rxi.IsAlwaysFinite α]
[PRange.LawfulUpwardEnumerable α]
{r : Roi α}
:
@[simp]
theorem
Std.Ric.toList_iter_eq_toList
{α : Type u_1}
[PRange.Least? α]
[LE α]
[DecidableLE α]
[PRange.UpwardEnumerable α]
[PRange.LawfulUpwardEnumerableLE α]
[Rxc.IsAlwaysFinite α]
[PRange.LawfulUpwardEnumerable α]
{r : Ric α}
:
@[simp]
theorem
Std.Rio.toList_iter_eq_toList
{α : Type u_1}
[PRange.Least? α]
[LT α]
[DecidableLT α]
[PRange.UpwardEnumerable α]
[PRange.LawfulUpwardEnumerableLT α]
[Rxo.IsAlwaysFinite α]
[PRange.LawfulUpwardEnumerable α]
{r : Rio α}
:
@[simp]
theorem
Std.Rii.toList_iter_eq_toList
{α : Type u_1}
[PRange.Least? α]
[PRange.UpwardEnumerable α]
[Rxi.IsAlwaysFinite α]
[PRange.LawfulUpwardEnumerable α]
{r : Rii α}
: