Theorem altxpsspw 36957

Description: An inclusion rule for alternate Cartesian products. (Contributed by Scott Fenton, 24-Mar-2012.)

Assertion

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

Proof of Theorem altxpsspw

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

Step	Hyp	Ref	Expression
1		elaltxp 36955	. . 3 ⊢ (𝑧 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫)
2		df-altop 36938	. . . . . 6 ⊢ ⟪𝑥, 𝑦⟫ = {{𝑥}, {𝑥, {𝑦}}}
3		snssi 4748	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴)
4		ssun3 4181	. . . . . . . . 9 ⊢ ({𝑥} ⊆ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵))
5	3, 4	syl 18	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵))
6	5	adantr 486	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵))
7		elun1 4183	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐴 ∪ 𝒫 𝐵))
8		snssi 4748	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ⊆ 𝐵)
9		vsnex 5400	. . . . . . . . . . . 12 ⊢ {𝑦} ∈ V
10	9	elpw 4564	. . . . . . . . . . 11 ⊢ ({𝑦} ∈ 𝒫 𝐵 ↔ {𝑦} ⊆ 𝐵)
11		elun2 4184	. . . . . . . . . . 11 ⊢ ({𝑦} ∈ 𝒫 𝐵 → {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵))
12	10, 11	sylbir 238	. . . . . . . . . 10 ⊢ ({𝑦} ⊆ 𝐵 → {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵))
13	8, 12	syl 18	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵))
14	7, 13	anim12i 625	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥 ∈ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵)))
15		vex 3458	. . . . . . . . 9 ⊢ 𝑥 ∈ V
16	15, 9	prss 4781	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵)) ↔ {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵))
17	14, 16	sylib 221	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵))
18		prex 5403	. . . . . . . . 9 ⊢ {{𝑥}, {𝑥, {𝑦}}} ∈ V
19	18	elpw 4564	. . . . . . . 8 ⊢ ({{𝑥}, {𝑥, {𝑦}}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ↔ {{𝑥}, {𝑥, {𝑦}}} ⊆ 𝒫 (𝐴 ∪ 𝒫 𝐵))
20		vsnex 5400	. . . . . . . . 9 ⊢ {𝑥} ∈ V
21		prex 5403	. . . . . . . . 9 ⊢ {𝑥, {𝑦}} ∈ V
22	20, 21	prsspw 4805	. . . . . . . 8 ⊢ ({{𝑥}, {𝑥, {𝑦}}} ⊆ 𝒫 (𝐴 ∪ 𝒫 𝐵) ↔ ({𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵)))
23	19, 22	bitri 278	. . . . . . 7 ⊢ ({{𝑥}, {𝑥, {𝑦}}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ↔ ({𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵)))
24	6, 17, 23	sylanbrc 595	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {{𝑥}, {𝑥, {𝑦}}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
25	2, 24	eqeltrid 2868	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⟪𝑥, 𝑦⟫ ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
26		eleq1a 2859	. . . . 5 ⊢ (⟪𝑥, 𝑦⟫ ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) → (𝑧 = ⟪𝑥, 𝑦⟫ → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)))
27	25, 26	syl 18	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = ⟪𝑥, 𝑦⟫ → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)))
28	27	rexlimivv 3208	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫ → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
29	1, 28	sylbi 220	. 2 ⊢ (𝑧 ∈ (𝐴 ×× 𝐵) → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
30	29	ssriv 3917	1 ⊢ (𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900   ∪ cun 4152  𝒫 cpw 4560  {csn 4588  {cpr 4590  ⟪caltop 36936   ×× caltxp 36937

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rex 3091  df-v 3456  df-ss 3901  df-un 4154  df-pw 4562  df-sn 4589  df-pr 4591  df-altop 36938  df-altxp 36939

This theorem is used by:  altxpexg  36958