Theorem xpsspw 5646

Description: A Cartesian product is included in the power of the power of the union of its arguments. (Contributed by NM, 13-Sep-2006.)

Assertion

Ref	Expression
xpsspw	⊢ (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵)

Proof of Theorem xpsspw

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

Step	Hyp	Ref	Expression
1		relxp 5537	. 2 ⊢ Rel (𝐴 × 𝐵)
2		opelxp 5555	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
3		snssi 4701	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴)
4		ssun3 4101	. . . . . . . 8 ⊢ ({𝑥} ⊆ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝐵))
5	3, 4	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝐵))
6		snex 5297	. . . . . . . 8 ⊢ {𝑥} ∈ V
7	6	elpw 4501	. . . . . . 7 ⊢ ({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ↔ {𝑥} ⊆ (𝐴 ∪ 𝐵))
8	5, 7	sylibr 237	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵))
9	8	adantr 484	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵))
10		df-pr 4528	. . . . . . 7 ⊢ {𝑥, 𝑦} = ({𝑥} ∪ {𝑦})
11		snssi 4701	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ⊆ 𝐵)
12		ssun4 4102	. . . . . . . . . 10 ⊢ ({𝑦} ⊆ 𝐵 → {𝑦} ⊆ (𝐴 ∪ 𝐵))
13	11, 12	syl 17	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ⊆ (𝐴 ∪ 𝐵))
14	5, 13	anim12i 615	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ⊆ (𝐴 ∪ 𝐵) ∧ {𝑦} ⊆ (𝐴 ∪ 𝐵)))
15		unss 4111	. . . . . . . 8 ⊢ (({𝑥} ⊆ (𝐴 ∪ 𝐵) ∧ {𝑦} ⊆ (𝐴 ∪ 𝐵)) ↔ ({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵))
16	14, 15	sylib 221	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵))
17	10, 16	eqsstrid 3963	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ⊆ (𝐴 ∪ 𝐵))
18		zfpair2 5296	. . . . . . 7 ⊢ {𝑥, 𝑦} ∈ V
19	18	elpw 4501	. . . . . 6 ⊢ ({𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵) ↔ {𝑥, 𝑦} ⊆ (𝐴 ∪ 𝐵))
20	17, 19	sylibr 237	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵))
21	9, 20	jca 515	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ∧ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵)))
22		prex 5298	. . . . . 6 ⊢ {{𝑥}, {𝑥, 𝑦}} ∈ V
23	22	elpw 4501	. . . . 5 ⊢ ({{𝑥}, {𝑥, 𝑦}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵) ↔ {{𝑥}, {𝑥, 𝑦}} ⊆ 𝒫 (𝐴 ∪ 𝐵))
24		vex 3444	. . . . . . 7 ⊢ 𝑥 ∈ V
25		vex 3444	. . . . . . 7 ⊢ 𝑦 ∈ V
26	24, 25	dfop 4762	. . . . . 6 ⊢ ⟨𝑥, 𝑦⟩ = {{𝑥}, {𝑥, 𝑦}}
27	26	eleq1i 2880	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵) ↔ {{𝑥}, {𝑥, 𝑦}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
28	6, 18	prss 4713	. . . . 5 ⊢ (({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ∧ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵)) ↔ {{𝑥}, {𝑥, 𝑦}} ⊆ 𝒫 (𝐴 ∪ 𝐵))
29	23, 27, 28	3bitr4ri 307	. . . 4 ⊢ (({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ∧ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵)) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
30	21, 29	sylib 221	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
31	2, 30	sylbi 220	. 2 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
32	1, 31	relssi 5624	1 ⊢ (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵)

Syntax hints:   ∧ wa 399   ∈ wcel 2111   ∪ cun 3879   ⊆ wss 3881  𝒫 cpw 4497  {csn 4525  {cpr 4527  ⟨cop 4531   × cxp 5517

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-opab 5093  df-xp 5525  df-rel 5526

This theorem is referenced by:  unixpss  5647  xpexg  7453  rankxpu  9289  wunxp  10135  gruxp  10218