Theorem altxpsspw 32597

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 32595	. . 3 ⊢ (𝑧 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫)
2		df-altop 32578	. . . . . 6 ⊢ ⟪𝑥, 𝑦⟫ = {{𝑥}, {𝑥, {𝑦}}}
3		snssi 4527	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴)
4		ssun3 3976	. . . . . . . . 9 ⊢ ({𝑥} ⊆ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵))
5	3, 4	syl 17	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵))
6	5	adantr 473	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵))
7		elun1 3978	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐴 ∪ 𝒫 𝐵))
8		snssi 4527	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ⊆ 𝐵)
9		snex 5099	. . . . . . . . . . . 12 ⊢ {𝑦} ∈ V
10	9	elpw 4355	. . . . . . . . . . 11 ⊢ ({𝑦} ∈ 𝒫 𝐵 ↔ {𝑦} ⊆ 𝐵)
11		elun2 3979	. . . . . . . . . . 11 ⊢ ({𝑦} ∈ 𝒫 𝐵 → {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵))
12	10, 11	sylbir 227	. . . . . . . . . 10 ⊢ ({𝑦} ⊆ 𝐵 → {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵))
13	8, 12	syl 17	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵))
14	7, 13	anim12i 607	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥 ∈ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵)))
15		vex 3388	. . . . . . . . 9 ⊢ 𝑥 ∈ V
16	15, 9	prss 4539	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑦} ∈ (𝐴 ∪ 𝒫 𝐵)) ↔ {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵))
17	14, 16	sylib 210	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵))
18		prex 5100	. . . . . . . . 9 ⊢ {{𝑥}, {𝑥, {𝑦}}} ∈ V
19	18	elpw 4355	. . . . . . . 8 ⊢ ({{𝑥}, {𝑥, {𝑦}}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ↔ {{𝑥}, {𝑥, {𝑦}}} ⊆ 𝒫 (𝐴 ∪ 𝒫 𝐵))
20		snex 5099	. . . . . . . . 9 ⊢ {𝑥} ∈ V
21		prex 5100	. . . . . . . . 9 ⊢ {𝑥, {𝑦}} ∈ V
22	20, 21	prsspw 4562	. . . . . . . 8 ⊢ ({{𝑥}, {𝑥, {𝑦}}} ⊆ 𝒫 (𝐴 ∪ 𝒫 𝐵) ↔ ({𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵)))
23	19, 22	bitri 267	. . . . . . 7 ⊢ ({{𝑥}, {𝑥, {𝑦}}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ↔ ({𝑥} ⊆ (𝐴 ∪ 𝒫 𝐵) ∧ {𝑥, {𝑦}} ⊆ (𝐴 ∪ 𝒫 𝐵)))
24	6, 17, 23	sylanbrc 579	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {{𝑥}, {𝑥, {𝑦}}} ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
25	2, 24	syl5eqel 2882	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⟪𝑥, 𝑦⟫ ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
26		eleq1a 2873	. . . . 5 ⊢ (⟪𝑥, 𝑦⟫ ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) → (𝑧 = ⟪𝑥, 𝑦⟫ → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)))
27	25, 26	syl 17	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = ⟪𝑥, 𝑦⟫ → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)))
28	27	rexlimivv 3217	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫ → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
29	1, 28	sylbi 209	. 2 ⊢ (𝑧 ∈ (𝐴 ×× 𝐵) → 𝑧 ∈ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵))
30	29	ssriv 3802	1 ⊢ (𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)

Syntax hints:   → wi 4   ∧ wa 385   = wceq 1653   ∈ wcel 2157  ∃wrex 3090   ∪ cun 3767   ⊆ wss 3769  𝒫 cpw 4349  {csn 4368  {cpr 4370  ⟪caltop 32576   ×× caltxp 32577

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777  ax-sep 4975  ax-nul 4983  ax-pr 5097

This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ral 3094  df-rex 3095  df-v 3387  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4116  df-pw 4351  df-sn 4369  df-pr 4371  df-altop 32578  df-altxp 32579

This theorem is referenced by:  altxpexg  32598