Basic facts about Thunk.

instance Thunk.instDecidableEq_mathlib {α : Type u} [DecidableEq α] : DecidableEq (Thunk α)

Equations

• a.instDecidableEq_mathlib b = let_fun this := ⋯; ⋯.mpr inferInstance

def Thunk.prod {α : Type u_1} {β : Type u_2} (a : Thunk α) (b : Thunk β) : Thunk (α × β)

The cartesian product of two thunks.

Equations

• a.prod b = { fn := fun (x : Unit) => (a.get, b.get) }

@[simp]

theorem Thunk.prod_get_fst : ∀ {α : Type u_1} {a : Thunk α} {α_1 : Type u_2} {b : Thunk α_1}, (a.prod b).get.fst = a.get

@[simp]

theorem Thunk.prod_get_snd : ∀ {α : Type u_1} {a : Thunk α} {α_1 : Type u_2} {b : Thunk α_1}, (a.prod b).get.snd = b.get

def Thunk.add {α : Type u_1} [Add α] (a : Thunk α) (b : Thunk α) : Thunk α

The sum of two thunks.

Equations

• a.add b = { fn := fun (x : Unit) => a.get + b.get }

instance Thunk.instAdd_mathlib {α : Type u_1} [Add α] : Add (Thunk α)

Equations

• Thunk.instAdd_mathlib = { add := Thunk.add }

@[simp]

theorem Thunk.add_get {α : Type u_1} [Add α] {a : Thunk α} {b : Thunk α} : (a + b).get = a.get + b.get