Skip to content
Merged
Changes from all commits
Commits
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
26 changes: 25 additions & 1 deletion LeanBlockCourse26/P06_Mathlib/S01_PrimeTheorem.lean
Original file line number Diff line number Diff line change
Expand Up @@ -183,7 +183,31 @@ theorem infinitude_of_primes_tfae : [

tfae_have 5 → 6 := by sorry -- Theo

tfae_have 2 → 3 := by sorry -- Arthur
tfae_have 2 → 3 := by -- Arthur
intro h S
let s := Set.infinite_univ_iff.2 h
let P := @Set.univ { p // Nat.Prime p }
by_contra a
push_neg at a
let PN := P.image Subtype.val
have PS : PN ⊆ S := by rw [Set.subset_def]
intro k b
by_contra l
have x : k ∉ S := by exact Finset.notMem_mono (fun ⦃a⦄ a_1 ↦ a_1) l
have knp := a k x
have kp : Nat.Prime k := by unfold PN at b
unfold P at b
simp at b
exact b
contradiction
have PNI : PN.Infinite := by unfold PN
unfold P
simp
exact Set.infinite_coe_iff.mp h
have SF : (S : Set ℕ).Finite := by exact Finset.finite_toSet S
obtain ⟨a , inn, nis⟩ := Set.Infinite.exists_notMem_finite PNI SF
let is := PS inn
contradiction

tfae_have 1 → 2 := by sorry -- Onat

Expand Down
Loading