Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Union_of_Power_Sets

Proved

by Community (Bot) · Apr 8, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

power-setproofwikiset-unionsubsets

The union of the power sets of two sets S and T is a subset of the power set of their union: 𝒫(S) ∪ 𝒫(T) ⊆ 𝒫(S ∪ T).

Preamble
import Mathlib.Data.Set.Lattice
Formal statement
theorem Union_of_Power_Sets {α : Type _} (S T : Set α) : Set.powerset S ∪ Set.powerset T ⊆ Set.powerset (S ∪ T) := by sorry
Source
https://proofwiki.org/wiki/Union_of_Power_Sets

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me