Theorem pwunssOLD 5448

Description: Obsolete version of pwunss 4552 as of 30-Dec-2023. (Contributed by NM, 23-Nov-2003.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
pwunssOLD	⊢ (𝒫 𝐴 ∪ 𝒫 𝐵) ⊆ 𝒫 (𝐴 ∪ 𝐵)

Proof of Theorem pwunssOLD

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssun 4158	. . 3 ⊢ ((𝑥 ⊆ 𝐴 ∨ 𝑥 ⊆ 𝐵) → 𝑥 ⊆ (𝐴 ∪ 𝐵))
2		elun 4118	. . . 4 ⊢ (𝑥 ∈ (𝒫 𝐴 ∪ 𝒫 𝐵) ↔ (𝑥 ∈ 𝒫 𝐴 ∨ 𝑥 ∈ 𝒫 𝐵))
3		velpw 4537	. . . . 5 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
4		velpw 4537	. . . . 5 ⊢ (𝑥 ∈ 𝒫 𝐵 ↔ 𝑥 ⊆ 𝐵)
5	3, 4	orbi12i 911	. . . 4 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∨ 𝑥 ∈ 𝒫 𝐵) ↔ (𝑥 ⊆ 𝐴 ∨ 𝑥 ⊆ 𝐵))
6	2, 5	bitri 277	. . 3 ⊢ (𝑥 ∈ (𝒫 𝐴 ∪ 𝒫 𝐵) ↔ (𝑥 ⊆ 𝐴 ∨ 𝑥 ⊆ 𝐵))
7		velpw 4537	. . 3 ⊢ (𝑥 ∈ 𝒫 (𝐴 ∪ 𝐵) ↔ 𝑥 ⊆ (𝐴 ∪ 𝐵))
8	1, 6, 7	3imtr4i 294	. 2 ⊢ (𝑥 ∈ (𝒫 𝐴 ∪ 𝒫 𝐵) → 𝑥 ∈ 𝒫 (𝐴 ∪ 𝐵))
9	8	ssriv 3964	1 ⊢ (𝒫 𝐴 ∪ 𝒫 𝐵) ⊆ 𝒫 (𝐴 ∪ 𝐵)

Syntax hints:   ∨ wo 843   ∈ wcel 2113   ∪ cun 3927   ⊆ wss 3929  𝒫 cpw 4532

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-v 3493  df-un 3934  df-in 3936  df-ss 3945  df-pw 4534

This theorem is referenced by: (None)