Theorem altxpsspw 33551

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 33549	. . 3 ⊢ (𝑧 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫)
2		df-altop 33532	. . . . . 6 ⊢ ⟪𝑥, 𝑦⟫ = {{𝑥}, {𝑥, {𝑦}}}
3		snssi 4701	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴)
4		ssun3 4101	. . . . . . . . 9 ⊢ ({𝑥} ⊆ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵))
5	3, 4	syl 17	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵))
6	5	adantr 484	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵))
7		elun1 4103	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐴 ∪ 𝒫 𝐵))
8		snssi 4701	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ⊆ 𝐵)
9		snex 5297	. . . . . . . . . . . 12 ⊢ {𝑦} ∈ V
10	9	elpw 4501	. . . . . . . . . . 11 ⊢ ({𝑦} ∈ 𝒫 𝐵 ↔ {𝑦} ⊆ 𝐵)
11		elun2 4104	. . . . . . . . . . 11 ⊢ ({𝑦} ∈ 𝒫 𝐵 → {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵))
12	10, 11	sylbir 238	. . . . . . . . . 10 ⊢ ({𝑦} ⊆ 𝐵 → {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵))
13	8, 12	syl 17	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵))
14	7, 13	anim12i 615	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥 ∈ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵)))
15		vex 3444	. . . . . . . . 9 ⊢ 𝑥 ∈ V
16	15, 9	prss 4713	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵)) ↔ {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵))
17	14, 16	sylib 221	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵))
18		prex 5298	. . . . . . . . 9 ⊢ {{𝑥}, {𝑥, {𝑦}}} ∈ V
19	18	elpw 4501	. . . . . . . 8 ⊢ ({{𝑥}, {𝑥, {𝑦}}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ↔ {{𝑥}, {𝑥, {𝑦}}} ⊆ 𝒫 (𝐴 ∪ 𝒫 𝐵))
20		snex 5297	. . . . . . . . 9 ⊢ {𝑥} ∈ V
21		prex 5298	. . . . . . . . 9 ⊢ {𝑥, {𝑦}} ∈ V
22	20, 21	prsspw 4736	. . . . . . . 8 ⊢ ({{𝑥}, {𝑥, {𝑦}}} ⊆ 𝒫 (𝐴 ∪ 𝒫 𝐵) ↔ ({𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵)))
23	19, 22	bitri 278	. . . . . . 7 ⊢ ({{𝑥}, {𝑥, {𝑦}}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ↔ ({𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵)))
24	6, 17, 23	sylanbrc 586	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {{𝑥}, {𝑥, {𝑦}}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
25	2, 24	eqeltrid 2894	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⟪𝑥, 𝑦⟫ ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
26		eleq1a 2885	. . . . 5 ⊢ (⟪𝑥, 𝑦⟫ ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) → (𝑧 = ⟪𝑥, 𝑦⟫ → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)))
27	25, 26	syl 17	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = ⟪𝑥, 𝑦⟫ → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)))
28	27	rexlimivv 3251	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫ → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
29	1, 28	sylbi 220	. 2 ⊢ (𝑧 ∈ (𝐴 ×× 𝐵) → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
30	29	ssriv 3919	1 ⊢ (𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∃wrex 3107   ∪ cun 3879   ⊆ wss 3881  𝒫 cpw 4497  {csn 4525  {cpr 4527  ⟪caltop 33530   ×× caltxp 33531

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-pw 4499  df-sn 4526  df-pr 4528  df-altop 33532  df-altxp 33533

This theorem is referenced by:  altxpexg  33552