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

Theorem ixp0 8913
Description: The infinite Cartesian product of a family 𝐵(𝑥) with an empty member is empty. The converse of this theorem is equivalent to the Axiom of Choice, see ac9 10440. (Contributed by NM, 1-Oct-2006.) (Proof shortened by Mario Carneiro, 22-Jun-2016.)
Assertion
Ref Expression
ixp0 (∃𝑥𝐴 𝐵 = ∅ → X𝑥𝐴 𝐵 = ∅)

Proof of Theorem ixp0
StepHypRef Expression
1 nne 2961 . . . 4 𝐵 ≠ ∅ ↔ 𝐵 = ∅)
21rexbii 3109 . . 3 (∃𝑥𝐴 ¬ 𝐵 ≠ ∅ ↔ ∃𝑥𝐴 𝐵 = ∅)
3 rexnal 3114 . . 3 (∃𝑥𝐴 ¬ 𝐵 ≠ ∅ ↔ ¬ ∀𝑥𝐴 𝐵 ≠ ∅)
42, 3bitr3i 279 . 2 (∃𝑥𝐴 𝐵 = ∅ ↔ ¬ ∀𝑥𝐴 𝐵 ≠ ∅)
5 ixpn0 8912 . . 3 (X𝑥𝐴 𝐵 ≠ ∅ → ∀𝑥𝐴 𝐵 ≠ ∅)
65necon1bi 2985 . 2 (¬ ∀𝑥𝐴 𝐵 ≠ ∅ → X𝑥𝐴 𝐵 = ∅)
74, 6sylbi 219 1 (∃𝑥𝐴 𝐵 = ∅ → X𝑥𝐴 𝐵 = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1560  wne 2957  wral 3076  wrex 3086  c0 4285  Xcixp 8879
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-12 2212  ax-ext 2734
This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3077  df-rex 3087  df-dif 3907  df-nul 4286  df-ixp 8880
This theorem is referenced by:  vonioo  47256  vonicc  47259
  Copyright terms: Public domain W3C validator