Theorem xpsspw 5676

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 5567	. 2 ⊢ Rel (𝐴 × 𝐵)
2		opelxp 5585	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
3		snssi 4734	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴)
4		ssun3 4149	. . . . . . . 8 ⊢ ({𝑥} ⊆ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝐵))
5	3, 4	syl 17	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝐵))
6		snex 5323	. . . . . . . 8 ⊢ {𝑥} ∈ V
7	6	elpw 4545	. . . . . . 7 ⊢ ({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ↔ {𝑥} ⊆ (𝐴 ∪ 𝐵))
8	5, 7	sylibr 236	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵))
9	8	adantr 483	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵))
10		df-pr 4563	. . . . . . 7 ⊢ {𝑥, 𝑦} = ({𝑥} ∪ {𝑦})
11		snssi 4734	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ⊆ 𝐵)
12		ssun4 4150	. . . . . . . . . 10 ⊢ ({𝑦} ⊆ 𝐵 → {𝑦} ⊆ (𝐴 ∪ 𝐵))
13	11, 12	syl 17	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ⊆ (𝐴 ∪ 𝐵))
14	5, 13	anim12i 614	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ⊆ (𝐴 ∪ 𝐵) ∧ {𝑦} ⊆ (𝐴 ∪ 𝐵)))
15		unss 4159	. . . . . . . 8 ⊢ (({𝑥} ⊆ (𝐴 ∪ 𝐵) ∧ {𝑦} ⊆ (𝐴 ∪ 𝐵)) ↔ ({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵))
16	14, 15	sylib 220	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ∪ {𝑦}) ⊆ (𝐴 ∪ 𝐵))
17	10, 16	eqsstrid 4014	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ⊆ (𝐴 ∪ 𝐵))
18		zfpair2 5322	. . . . . . 7 ⊢ {𝑥, 𝑦} ∈ V
19	18	elpw 4545	. . . . . 6 ⊢ ({𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵) ↔ {𝑥, 𝑦} ⊆ (𝐴 ∪ 𝐵))
20	17, 19	sylibr 236	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵))
21	9, 20	jca 514	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ∧ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵)))
22		prex 5324	. . . . . 6 ⊢ {{𝑥}, {𝑥, 𝑦}} ∈ V
23	22	elpw 4545	. . . . 5 ⊢ ({{𝑥}, {𝑥, 𝑦}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵) ↔ {{𝑥}, {𝑥, 𝑦}} ⊆ 𝒫 (𝐴 ∪ 𝐵))
24		vex 3497	. . . . . . 7 ⊢ 𝑥 ∈ V
25		vex 3497	. . . . . . 7 ⊢ 𝑦 ∈ V
26	24, 25	dfop 4795	. . . . . 6 ⊢ ⟨𝑥, 𝑦⟩ = {{𝑥}, {𝑥, 𝑦}}
27	26	eleq1i 2903	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵) ↔ {{𝑥}, {𝑥, 𝑦}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
28	6, 18	prss 4746	. . . . 5 ⊢ (({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ∧ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵)) ↔ {{𝑥}, {𝑥, 𝑦}} ⊆ 𝒫 (𝐴 ∪ 𝐵))
29	23, 27, 28	3bitr4ri 306	. . . 4 ⊢ (({𝑥} ∈ 𝒫 (𝐴 ∪ 𝐵) ∧ {𝑥, 𝑦} ∈ 𝒫 (𝐴 ∪ 𝐵)) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
30	21, 29	sylib 220	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
31	2, 30	sylbi 219	. 2 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ 𝒫 𝒫 (𝐴 ∪ 𝐵))
32	1, 31	relssi 5654	1 ⊢ (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵)

Syntax hints:   ∧ wa 398   ∈ wcel 2110   ∪ cun 3933   ⊆ wss 3935  𝒫 cpw 4538  {csn 4560  {cpr 4562  ⟨cop 4566   × cxp 5547

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-nul 5202  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-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-op 4567  df-opab 5121  df-xp 5555  df-rel 5556

This theorem is referenced by:  unixpss  5677  xpexg  7467  rankxpu  9299  wunxp  10140  gruxp  10223