Theorem altxpexg 35979

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 35978	. 2 ⊢ (𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)
2		pwexg 5378	. . . 4 ⊢ (𝐵 ∈ 𝑊 → 𝒫 𝐵 ∈ V)
3		unexg 7763	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝒫 𝐵 ∈ V) → (𝐴 ∪ 𝒫 𝐵) ∈ V)
4	2, 3	sylan2 593	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ∪ 𝒫 𝐵) ∈ V)
5		pwexg 5378	. . 3 ⊢ ((𝐴 ∪ 𝒫 𝐵) ∈ V → 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V)
6		pwexg 5378	. . 3 ⊢ (𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V → 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V)
7	4, 5, 6	3syl 18	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V)
8		ssexg 5323	. 2 ⊢ (((𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∧ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V) → (𝐴 ×× 𝐵) ∈ V)
9	1, 7, 8	sylancr 587	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ×× 𝐵) ∈ V)

Syntax hints:   → wi 4   ∧ wa 395   ∈ wcel 2108  Vcvv 3480   ∪ cun 3949   ⊆ wss 3951  𝒫 cpw 4600   ×× caltxp 35958

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 2007  ax-8 2110  ax-9 2118  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-pw 4602  df-sn 4627  df-pr 4629  df-uni 4908  df-altop 35959  df-altxp 35960

This theorem is referenced by: (None)