Skip to content

Fix Section 8.4: unused vars and missing sorry #470

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

Merged
teorth merged 1 commit into from
Mar 22, 2026
Merged

Fix Section 8.4: unused vars and missing sorry #470

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
7 changes: 4 additions & 3 deletions analysis/Analysis/Section_8_4.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -52,8 +52,8 @@ def CartesianProduct.equiv {I U: Type} (X : I → Set U) :
def Function.equiv {I X:Type} : (∀ _:I, X) ≃ (I → X) := {
toFun f := f
invFun f := f
left_inv f := rfl
right_inv f := rfl
left_inv _ := rfl
right_inv _ := rfl
}

def product_zero_equiv {X: Fin 0 → Type} : (∀ i:Fin 0, X i) ≃ PUnit := {
Expand Down Expand Up @@ -147,7 +147,8 @@ theorem exists_function {X Y : Type} {P : X → Y → Prop} (h: ∀ x, ∃ y, P
from `exists_function`, avoiding previous results that relied more explicitly
on the axiom of choice. -/
theorem axiom_of_choice_from_exists_function {I: Type} {X: I → Type} (h : ∀ i, Nonempty (X i)) :
Nonempty (∀ i, X i) := ⟨ fun i ↦ (h i).some ⟩
Nonempty (∀ i, X i) := by
sorry

/-- Exercise 8.4.2 -/
theorem exists_set_singleton_intersect {I U:Type} {X: I → Set U} (h: Set.PairwiseDisjoint .univ X)
Expand Down
Loading