Theorem altxpexg 36559

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 36558	. 2 ⊢ (𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)
2		pwexg 5343	. . . 4 ⊢ (𝐵 ∈ 𝑊 → 𝒫 𝐵 ∈ V)
3		unexg 7746	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝒫 𝐵 ∈ V) → (𝐴 ∪ 𝒫 𝐵) ∈ V)
4	2, 3	sylan2 605	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ∪ 𝒫 𝐵) ∈ V)
5		pwexg 5343	. . 3 ⊢ ((𝐴 ∪ 𝒫 𝐵) ∈ V → 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V)
6		pwexg 5343	. . 3 ⊢ (𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V → 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V)
7	4, 5, 6	3syl 19	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V)
8		ssexg 5284	. 2 ⊢ (((𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∧ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵) ∈ V) → (𝐴 ×× 𝐵) ∈ V)
9	1, 7, 8	sylancr 599	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ×× 𝐵) ∈ V)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2145  Vcvv 3450   ∪ cun 3897   ⊆ wss 3899  𝒫 cpw 4557   ×× caltxp 36538

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rex 3087  df-rab 3413  df-v 3452  df-un 3904  df-in 3906  df-ss 3916  df-pw 4559  df-sn 4585  df-pr 4587  df-uni 4868  df-altop 36539  df-altxp 36540

This theorem is used by: (None)