Theorem xpexr2m 5107

Description: If a nonempty cross product is a set, so are both of its components. (Contributed by Jim Kingdon, 14-Dec-2018.)

Assertion

Ref	Expression
xpexr2m	⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ ∃𝑥 𝑥 ∈ (𝐴 × 𝐵)) → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem xpexr2m

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpm 5087	. 2 ⊢ ((∃𝑎 𝑎 ∈ 𝐴 ∧ ∃𝑏 𝑏 ∈ 𝐵) ↔ ∃𝑥 𝑥 ∈ (𝐴 × 𝐵))
2		dmxpm 4882	. . . . . 6 ⊢ (∃𝑏 𝑏 ∈ 𝐵 → dom (𝐴 × 𝐵) = 𝐴)
3	2	adantl 277	. . . . 5 ⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ ∃𝑏 𝑏 ∈ 𝐵) → dom (𝐴 × 𝐵) = 𝐴)
4		dmexg 4926	. . . . . 6 ⊢ ((𝐴 × 𝐵) ∈ 𝐶 → dom (𝐴 × 𝐵) ∈ V)
5	4	adantr 276	. . . . 5 ⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ ∃𝑏 𝑏 ∈ 𝐵) → dom (𝐴 × 𝐵) ∈ V)
6	3, 5	eqeltrrd 2271	. . . 4 ⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ ∃𝑏 𝑏 ∈ 𝐵) → 𝐴 ∈ V)
7		rnxpm 5095	. . . . . 6 ⊢ (∃𝑎 𝑎 ∈ 𝐴 → ran (𝐴 × 𝐵) = 𝐵)
8	7	adantl 277	. . . . 5 ⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ ∃𝑎 𝑎 ∈ 𝐴) → ran (𝐴 × 𝐵) = 𝐵)
9		rnexg 4927	. . . . . 6 ⊢ ((𝐴 × 𝐵) ∈ 𝐶 → ran (𝐴 × 𝐵) ∈ V)
10	9	adantr 276	. . . . 5 ⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ ∃𝑎 𝑎 ∈ 𝐴) → ran (𝐴 × 𝐵) ∈ V)
11	8, 10	eqeltrrd 2271	. . . 4 ⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ ∃𝑎 𝑎 ∈ 𝐴) → 𝐵 ∈ V)
12	6, 11	anim12dan 600	. . 3 ⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ (∃𝑏 𝑏 ∈ 𝐵 ∧ ∃𝑎 𝑎 ∈ 𝐴)) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
13	12	ancom2s 566	. 2 ⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ (∃𝑎 𝑎 ∈ 𝐴 ∧ ∃𝑏 𝑏 ∈ 𝐵)) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
14	1, 13	sylan2br 288	1 ⊢ (((𝐴 × 𝐵) ∈ 𝐶 ∧ ∃𝑥 𝑥 ∈ (𝐴 × 𝐵)) → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364  ∃wex 1503   ∈ wcel 2164  Vcvv 2760   × cxp 4657  dom cdm 4659  ran crn 4660

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-xp 4665  df-rel 4666  df-cnv 4667  df-dm 4669  df-rn 4670

This theorem is referenced by: (None)