Theorem altxpexg 35971

Description: The alternate Cartesian product of two sets is a set. (Contributed by Scott Fenton, 24-Mar-2012.)

Assertion

Ref	Expression
altxpexg	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ×× 𝐵) ∈ V)

Proof of Theorem altxpexg

Step	Hyp	Ref	Expression
1		altxpsspw 35970	. 2 ⊢ (𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)
2		pwexg 5320	. . . 4 ⊢ (𝐵 ∈ 𝑊 → 𝒫 𝐵 ∈ V)
3		unexg 7683	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝒫 𝐵 ∈ V) → (𝐴 ∪ 𝒫 𝐵) ∈ V)
4	2, 3	sylan2 593	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ∪ 𝒫 𝐵) ∈ V)
5		pwexg 5320	. . 3 ⊢ ((𝐴 ∪ 𝒫 𝐵) ∈ V → 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V)
6		pwexg 5320	. . 3 ⊢ (𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V → 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V)
7	4, 5, 6	3syl 18	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V)
8		ssexg 5265	. 2 ⊢ (((𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∧ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V) → (𝐴 ×× 𝐵) ∈ V)
9	1, 7, 8	sylancr 587	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ×× 𝐵) ∈ V)

Syntax hints:   → wi 4   ∧ wa 395   ∈ wcel 2109  Vcvv 3438   ∪ cun 3903   ⊆ wss 3905  𝒫 cpw 4553   ×× caltxp 35950

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rex 3054  df-rab 3397  df-v 3440  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-pw 4555  df-sn 4580  df-pr 4582  df-uni 4862  df-altop 35951  df-altxp 35952

This theorem is referenced by: (None)