/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import Mathlib.Combinatorics.Enumerative.Partition.Basic@[expose] public sectionnamespace Natdef partitionNumber : ℕ → ℕ := fun n ↦ Fintype.card (Nat.Partition n)theorem partitionNumber_zero : partitionNumber 0 = 1 := ⊢ partitionNumber 0 = 1 All goals completed! 🐙theorem partitionNumber_one : partitionNumber 1 = 1 := ⊢ partitionNumber 1 = 1 All goals completed! 🐙

The only partitions of 2 are 2 and 1 + 1.

ha:0 < 2a✝:∀ (hpos : ∀ {i : ℕ}, i ∈ 0 → 0 < i) (hsum : Multiset.sum 0 = 2), { parts := 0, parts_pos := hpos, parts_sum := hsum }.parts = {2} ∨ { parts := 0, parts_pos := hpos, parts_sum := hsum }.parts = {1, 1}hs:∀ {i : ℕ}, i ∈ 0 → 0 < ihpos:∀ {i : ℕ}, i ∈ 2 ::ₘ 0 → 0 < ihsum✝:(2 ::ₘ 0).sum = 2hsum:2 + Multiset.sum 0 = 2⊢ { parts := 2 ::ₘ 0, parts_pos := hpos, parts_sum := hsum✝ }.parts = {2} ∨ { parts := 2 ::ₘ 0, parts_pos := hpos, parts_sum := hsum✝ }.parts = {1, 1} All goals completed! 🐙⊢ ∃ x y, x ≠ y ∧ Finset.univ = {x, y} refine ⟨⟨{2}, ⊢ ∀ {i : ℕ}, i ∈ {2} → 0 < i All goals completed! 🐙, rfl⟩, ⟨{1, 1}, ⊢ ∀ {i : ℕ}, i ∈ {1, 1} → 0 < i All goals completed! 🐙, rfl⟩, ⊢ { parts := {2}, parts_pos := ⋯, parts_sum := ⋯ } ≠ { parts := {1, 1}, parts_pos := ⋯, parts_sum := ⋯ } All goals completed! 🐙, ?_⟩ p:Partition 2⊢ p ∈ Finset.univ ↔ p ∈ {{ parts := {2}, parts_pos := ⋯, parts_sum := ⋯ }, { parts := {1, 1}, parts_pos := ⋯, parts_sum := ⋯ }} All goals completed! 🐙end Nat