Theorem xpsspw 5684

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 5575	. 2 ⊢ Rel (𝐴 × 𝐵)
2		opelxp 5593	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
3		snssi 4743	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴)
4		ssun3 4152	. . . . . . . 8 ⊢ ({𝑥} ⊆ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝐵))
5	3, 4	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝐵))
6		snex 5334	. . . . . . . 8 ⊢ {𝑥} ∈ V
7	6	elpw 4545	. . . . . . 7 ⊢ ({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ↔ {𝑥} ⊆ (𝐴 ∪ 𝐵))
8	5, 7	sylibr 236	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵))
9	8	adantr 483	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵))
10		df-pr 4572	. . . . . . 7 ⊢ {𝑥, 𝑦} = ({𝑥} ∪ {𝑦})
11		snssi 4743	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ⊆ 𝐵)
12		ssun4 4153	. . . . . . . . . 10 ⊢ ({𝑦} ⊆ 𝐵 → {𝑦} ⊆ (𝐴 ∪ 𝐵))
13	11, 12	syl 17	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ⊆ (𝐴 ∪ 𝐵))
14	5, 13	anim12i 614	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ⊆ (𝐴 ∪ 𝐵) ∧ {𝑦} ⊆ (𝐴 ∪ 𝐵)))
15		unss 4162	. . . . . . . 8 ⊢ (({𝑥} ⊆ (𝐴 ∪ 𝐵) ∧ {𝑦} ⊆ (𝐴 ∪ 𝐵)) ↔ ({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵))
16	14, 15	sylib 220	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵))
17	10, 16	eqsstrid 4017	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ⊆ (𝐴 ∪ 𝐵))
18		zfpair2 5333	. . . . . . 7 ⊢ {𝑥, 𝑦} ∈ V
19	18	elpw 4545	. . . . . 6 ⊢ ({𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵) ↔ {𝑥, 𝑦} ⊆ (𝐴 ∪ 𝐵))
20	17, 19	sylibr 236	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵))
21	9, 20	jca 514	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ∧ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵)))
22		prex 5335	. . . . . 6 ⊢ {{𝑥}, {𝑥, 𝑦}} ∈ V
23	22	elpw 4545	. . . . 5 ⊢ ({{𝑥}, {𝑥, 𝑦}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵) ↔ {{𝑥}, {𝑥, 𝑦}} ⊆ 𝒫 (𝐴 ∪ 𝐵))
24		vex 3499	. . . . . . 7 ⊢ 𝑥 ∈ V
25		vex 3499	. . . . . . 7 ⊢ 𝑦 ∈ V
26	24, 25	dfop 4804	. . . . . 6 ⊢ ⟨𝑥, 𝑦⟩ = {{𝑥}, {𝑥, 𝑦}}
27	26	eleq1i 2905	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵) ↔ {{𝑥}, {𝑥, 𝑦}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
28	6, 18	prss 4755	. . . . 5 ⊢ (({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ∧ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵)) ↔ {{𝑥}, {𝑥, 𝑦}} ⊆ 𝒫 (𝐴 ∪ 𝐵))
29	23, 27, 28	3bitr4ri 306	. . . 4 ⊢ (({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ∧ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵)) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
30	21, 29	sylib 220	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
31	2, 30	sylbi 219	. 2 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
32	1, 31	relssi 5662	1 ⊢ (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵)

Syntax hints:   ∧ wa 398   ∈ wcel 2114   ∪ cun 3936   ⊆ wss 3938  𝒫 cpw 4541  {csn 4569  {cpr 4571  ⟨cop 4575   × cxp 5555

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-opab 5131  df-xp 5563  df-rel 5564

This theorem is referenced by:  unixpss  5685  xpexg  7475  rankxpu  9307  wunxp  10148  gruxp  10231