Theorem pwssun 5449

Description: The power class of the union of two classes is a subset of the union of their power classes, iff one class is a subclass of the other. Exercise 4.12(l) of [Mendelson] p. 235. (Contributed by NM, 23-Nov-2003.)

Assertion

Ref	Expression
pwssun	⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴) ↔ 𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵))

Proof of Theorem pwssun

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssequn2 4158	. . . . . 6 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐴 ∪ 𝐵) = 𝐴)
2		pweq 4541	. . . . . . 7 ⊢ ((𝐴 ∪ 𝐵) = 𝐴 → 𝒫 (𝐴 ∪ 𝐵) = 𝒫 𝐴)
3		eqimss 4022	. . . . . . 7 ⊢ (𝒫 (𝐴 ∪ 𝐵) = 𝒫 𝐴 → 𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐴)
4	2, 3	syl 17	. . . . . 6 ⊢ ((𝐴 ∪ 𝐵) = 𝐴 → 𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐴)
5	1, 4	sylbi 219	. . . . 5 ⊢ (𝐵 ⊆ 𝐴 → 𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐴)
6		ssequn1 4155	. . . . . 6 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ 𝐵) = 𝐵)
7		pweq 4541	. . . . . . 7 ⊢ ((𝐴 ∪ 𝐵) = 𝐵 → 𝒫 (𝐴 ∪ 𝐵) = 𝒫 𝐵)
8		eqimss 4022	. . . . . . 7 ⊢ (𝒫 (𝐴 ∪ 𝐵) = 𝒫 𝐵 → 𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐵)
9	7, 8	syl 17	. . . . . 6 ⊢ ((𝐴 ∪ 𝐵) = 𝐵 → 𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐵)
10	6, 9	sylbi 219	. . . . 5 ⊢ (𝐴 ⊆ 𝐵 → 𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐵)
11	5, 10	orim12i 905	. . . 4 ⊢ ((𝐵 ⊆ 𝐴 ∨ 𝐴 ⊆ 𝐵) → (𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐴 ∨ 𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐵))
12	11	orcoms 868	. . 3 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴) → (𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐴 ∨ 𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐵))
13		ssun 4164	. . 3 ⊢ ((𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐴 ∨ 𝒫 (𝐴 ∪ 𝐵) ⊆ 𝒫 𝐵) → 𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵))
14	12, 13	syl 17	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴) → 𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵))
15		vex 3497	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝑥 ∈ V
16	15	snss 4711	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ 𝐴 ↔ {𝑥} ⊆ 𝐴)
17		vex 3497	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝑦 ∈ V
18	17	snss 4711	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ 𝐵 ↔ {𝑦} ⊆ 𝐵)
19		unss12 4157	. . . . . . . . . . . . . . . . . . 19 ⊢ (({𝑥} ⊆ 𝐴 ∧ {𝑦} ⊆ 𝐵) → ({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵))
20	16, 18, 19	syl2anb 599	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵))
21		zfpair2 5322	. . . . . . . . . . . . . . . . . . . 20 ⊢ {𝑥, 𝑦} ∈ V
22	21	elpw 4545	. . . . . . . . . . . . . . . . . . 19 ⊢ ({𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵) ↔ {𝑥, 𝑦} ⊆ (𝐴 ∪ 𝐵))
23		df-pr 4563	. . . . . . . . . . . . . . . . . . . 20 ⊢ {𝑥, 𝑦} = ({𝑥} ∪ {𝑦})
24	23	sseq1i 3994	. . . . . . . . . . . . . . . . . . 19 ⊢ ({𝑥, 𝑦} ⊆ (𝐴 ∪ 𝐵) ↔ ({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵))
25	22, 24	bitr2i 278	. . . . . . . . . . . . . . . . . 18 ⊢ (({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵) ↔ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵))
26	20, 25	sylib 220	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵))
27		ssel 3960	. . . . . . . . . . . . . . . . 17 ⊢ (𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) → ({𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵) → {𝑥, 𝑦} ∈ (𝒫 𝐴 ∪ 𝒫 𝐵)))
28	26, 27	syl5 34	. . . . . . . . . . . . . . . 16 ⊢ (𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ∈ (𝒫 𝐴 ∪ 𝒫 𝐵)))
29	28	expcomd 419	. . . . . . . . . . . . . . 15 ⊢ (𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) → (𝑦 ∈ 𝐵 → (𝑥 ∈ 𝐴 → {𝑥, 𝑦} ∈ (𝒫 𝐴 ∪ 𝒫 𝐵))))
30	29	imp31 420	. . . . . . . . . . . . . 14 ⊢ (((𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → {𝑥, 𝑦} ∈ (𝒫 𝐴 ∪ 𝒫 𝐵))
31		elun 4124	. . . . . . . . . . . . . 14 ⊢ ({𝑥, 𝑦} ∈ (𝒫 𝐴 ∪ 𝒫 𝐵) ↔ ({𝑥, 𝑦} ∈ 𝒫 𝐴 ∨ {𝑥, 𝑦} ∈ 𝒫 𝐵))
32	30, 31	sylib 220	. . . . . . . . . . . . 13 ⊢ (((𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ({𝑥, 𝑦} ∈ 𝒫 𝐴 ∨ {𝑥, 𝑦} ∈ 𝒫 𝐵))
33	21	elpw 4545	. . . . . . . . . . . . . . . 16 ⊢ ({𝑥, 𝑦} ∈ 𝒫 𝐴 ↔ {𝑥, 𝑦} ⊆ 𝐴)
34	15, 17	prss 4746	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ↔ {𝑥, 𝑦} ⊆ 𝐴)
35	33, 34	bitr4i 280	. . . . . . . . . . . . . . 15 ⊢ ({𝑥, 𝑦} ∈ 𝒫 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴))
36	35	simprbi 499	. . . . . . . . . . . . . 14 ⊢ ({𝑥, 𝑦} ∈ 𝒫 𝐴 → 𝑦 ∈ 𝐴)
37	21	elpw 4545	. . . . . . . . . . . . . . . 16 ⊢ ({𝑥, 𝑦} ∈ 𝒫 𝐵 ↔ {𝑥, 𝑦} ⊆ 𝐵)
38	15, 17	prss 4746	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵)
39	37, 38	bitr4i 280	. . . . . . . . . . . . . . 15 ⊢ ({𝑥, 𝑦} ∈ 𝒫 𝐵 ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))
40	39	simplbi 500	. . . . . . . . . . . . . 14 ⊢ ({𝑥, 𝑦} ∈ 𝒫 𝐵 → 𝑥 ∈ 𝐵)
41	36, 40	orim12i 905	. . . . . . . . . . . . 13 ⊢ (({𝑥, 𝑦} ∈ 𝒫 𝐴 ∨ {𝑥, 𝑦} ∈ 𝒫 𝐵) → (𝑦 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
42	32, 41	syl 17	. . . . . . . . . . . 12 ⊢ (((𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
43	42	ord 860	. . . . . . . . . . 11 ⊢ (((𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → (¬ 𝑦 ∈ 𝐴 → 𝑥 ∈ 𝐵))
44	43	impancom 454	. . . . . . . . . 10 ⊢ (((𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
45	44	ssrdv 3972	. . . . . . . . 9 ⊢ (((𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴) → 𝐴 ⊆ 𝐵)
46	45	exp31 422	. . . . . . . 8 ⊢ (𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) → (𝑦 ∈ 𝐵 → (¬ 𝑦 ∈ 𝐴 → 𝐴 ⊆ 𝐵)))
47		con1b 361	. . . . . . . 8 ⊢ ((¬ 𝑦 ∈ 𝐴 → 𝐴 ⊆ 𝐵) ↔ (¬ 𝐴 ⊆ 𝐵 → 𝑦 ∈ 𝐴))
48	46, 47	syl6ib 253	. . . . . . 7 ⊢ (𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) → (𝑦 ∈ 𝐵 → (¬ 𝐴 ⊆ 𝐵 → 𝑦 ∈ 𝐴)))
49	48	com23 86	. . . . . 6 ⊢ (𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) → (¬ 𝐴 ⊆ 𝐵 → (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐴)))
50	49	imp 409	. . . . 5 ⊢ ((𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) ∧ ¬ 𝐴 ⊆ 𝐵) → (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐴))
51	50	ssrdv 3972	. . . 4 ⊢ ((𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) ∧ ¬ 𝐴 ⊆ 𝐵) → 𝐵 ⊆ 𝐴)
52	51	ex 415	. . 3 ⊢ (𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) → (¬ 𝐴 ⊆ 𝐵 → 𝐵 ⊆ 𝐴))
53	52	orrd 859	. 2 ⊢ (𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))
54	14, 53	impbii 211	1 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴) ↔ 𝒫 (𝐴 ∪ 𝐵) ⊆ (𝒫 𝐴 ∪ 𝒫 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∨ wo 843   = wceq 1533   ∈ wcel 2110   ∪ cun 3933   ⊆ wss 3935  𝒫 cpw 4538  {csn 4560  {cpr 4562

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-pr 5321

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3496  df-un 3940  df-in 3942  df-ss 3951  df-pw 4540  df-sn 4561  df-pr 4563

This theorem is referenced by:  pwun  5452