Theorem xpexcnv 7905

Description: A condition where the converse of xpex 7740 holds as well. Corollary 6.9(2) in [TakeutiZaring] p. 26. (Contributed by Andrew Salmon, 13-Nov-2011.)

Assertion

Ref	Expression
xpexcnv	⊢ ((𝐵 ≠ ∅ ∧ (𝐴 × 𝐵) ∈ V) → 𝐴 ∈ V)

Proof of Theorem xpexcnv

Step	Hyp	Ref	Expression
1		dmexg 7886	. . 3 ⊢ ((𝐴 × 𝐵) ∈ V → dom (𝐴 × 𝐵) ∈ V)
2		dmxp 5910	. . . 4 ⊢ (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴)
3	2	eleq1d 2850	. . 3 ⊢ (𝐵 ≠ ∅ → (dom (𝐴 × 𝐵) ∈ V ↔ 𝐴 ∈ V))
4	1, 3	imbitrid 247	. 2 ⊢ (𝐵 ≠ ∅ → ((𝐴 × 𝐵) ∈ V → 𝐴 ∈ V))
5	4	imp 411	1 ⊢ ((𝐵 ≠ ∅ ∧ (𝐴 × 𝐵) ∈ V) → 𝐴 ∈ V)

Syntax hints:   → wi 4   ∧ wa 400   ∈ wcel 2145   ≠ wne 2960  Vcvv 3457  ∅c0 4288   × cxp 5650  dom cdm 5652

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5251  ax-pr 5395  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-xp 5658  df-cnv 5660  df-dm 5662  df-rn 5663

This theorem is referenced by:  fczsupp0  8177