Skip to content

Use x consistently for collections in the ForIn file #24

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
DavidLedvinka wants to merge 1 commit into
base: main
Choose a base branch
from
+8 −8
Open

Use x consistently for collections in the ForIn file #24

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 8 additions & 8 deletions RandomDo/MeasurableSpaceMonad/ForIn.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -68,8 +68,8 @@ class MeasurableSpaceForIn' (m : (α : Type u) → [MeasurableSpace α] → Type
proof that the current element is in the collection. This is the measurable space analogue of
`ForIn'.forIn'`.
-/
forIn' {β : Type u} [MeasurableSpace β] (x : ρ) (b : β)
(f : (a : α) → a ∈ x → β → m (ForInStep β)) : m β
forIn' {β : Type u} [MeasurableSpace β] (xs : ρ) (b : β)
(f : (a : α) → a ∈ xs → β → m (ForInStep β)) : m β

export MeasurableSpaceForIn' (forIn')

Expand All @@ -82,21 +82,21 @@ membership proof. We set the priority to 500 so it is below the default.
@[default_instance]
instance (priority := 500) instMeasurableSpaceForInOfForIn' {d : Membership α ρ}
[MeasurableSpaceForIn' m ρ α d] : MeasurableSpaceForIn m ρ α where
forIn x b f := forIn' x b fun a _ => f a
forIn xs b f := forIn' xs b fun a _ => f a

@[simp] theorem forIn'_eq_forIn [d : Membership α ρ] [MeasurableSpaceForIn' m ρ α d]
{β : Type u} [MeasurableSpace β] (x : ρ) (b : β)
(f : (a : α) → a ∈ x → β → m (ForInStep β)) (g : (a : α) → β → m (ForInStep β))
{β : Type u} [MeasurableSpace β] (xs : ρ) (b : β)
(f : (a : α) → a ∈ xs → β → m (ForInStep β)) (g : (a : α) → β → m (ForInStep β))
(h : ∀ a h b, f a h b = g a b) :
forIn' x b f = forIn x b g := by
forIn' xs b f = forIn xs b g := by
simp only [forIn]
congr
funext a ha b
exact h a ha b

@[wf_preprocess] theorem forIn_eq_forIn' [d : Membership α ρ] [MeasurableSpaceForIn' m ρ α d]
{β : Type u} [MeasurableSpace β] (x : ρ) (b : β) (f : α → β → m (ForInStep β)) :
forIn x b f = forIn' x b (fun x h => binderNameHint x f <| binderNameHint h () <| f x) := by
{β : Type u} [MeasurableSpace β] (xs : ρ) (b : β) (f : α → β → m (ForInStep β)) :
forIn xs b f = forIn' xs b (fun x h => binderNameHint x f <| binderNameHint h () <| f x) := by
rfl

end MeasureTheory
Loading