Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  xpexr Structured version   Visualization version   GIF version

Theorem xpexr 7060
 Description: If a Cartesian product is a set, one of its components must be a set. (Contributed by NM, 27-Aug-2006.)
Assertion
Ref Expression
xpexr ((𝐴 × 𝐵) ∈ 𝐶 → (𝐴 ∈ V ∨ 𝐵 ∈ V))

Proof of Theorem xpexr
StepHypRef Expression
1 0ex 4755 . . . . . 6 ∅ ∈ V
2 eleq1 2686 . . . . . 6 (𝐴 = ∅ → (𝐴 ∈ V ↔ ∅ ∈ V))
31, 2mpbiri 248 . . . . 5 (𝐴 = ∅ → 𝐴 ∈ V)
43pm2.24d 147 . . . 4 (𝐴 = ∅ → (¬ 𝐴 ∈ V → 𝐵 ∈ V))
54a1d 25 . . 3 (𝐴 = ∅ → ((𝐴 × 𝐵) ∈ 𝐶 → (¬ 𝐴 ∈ V → 𝐵 ∈ V)))
6 rnexg 7052 . . . . 5 ((𝐴 × 𝐵) ∈ 𝐶 → ran (𝐴 × 𝐵) ∈ V)
7 rnxp 5528 . . . . . 6 (𝐴 ≠ ∅ → ran (𝐴 × 𝐵) = 𝐵)
87eleq1d 2683 . . . . 5 (𝐴 ≠ ∅ → (ran (𝐴 × 𝐵) ∈ V ↔ 𝐵 ∈ V))
96, 8syl5ib 234 . . . 4 (𝐴 ≠ ∅ → ((𝐴 × 𝐵) ∈ 𝐶𝐵 ∈ V))
109a1dd 50 . . 3 (𝐴 ≠ ∅ → ((𝐴 × 𝐵) ∈ 𝐶 → (¬ 𝐴 ∈ V → 𝐵 ∈ V)))
115, 10pm2.61ine 2873 . 2 ((𝐴 × 𝐵) ∈ 𝐶 → (¬ 𝐴 ∈ V → 𝐵 ∈ V))
1211orrd 393 1 ((𝐴 × 𝐵) ∈ 𝐶 → (𝐴 ∈ V ∨ 𝐵 ∈ V))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 383   = wceq 1480   ∈ wcel 1987   ≠ wne 2790  Vcvv 3189  ∅c0 3896   × cxp 5077  ran crn 5080 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4746  ax-nul 4754  ax-pr 4872  ax-un 6909 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3191  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-nul 3897  df-if 4064  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-br 4619  df-opab 4679  df-xp 5085  df-rel 5086  df-cnv 5087  df-dm 5089  df-rn 5090 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator