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

Theorem ixp0 8497
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 9907. (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 3022 . . . 4 𝐵 ≠ ∅ ↔ 𝐵 = ∅)
21rexbii 3249 . . 3 (∃𝑥𝐴 ¬ 𝐵 ≠ ∅ ↔ ∃𝑥𝐴 𝐵 = ∅)
3 rexnal 3240 . . 3 (∃𝑥𝐴 ¬ 𝐵 ≠ ∅ ↔ ¬ ∀𝑥𝐴 𝐵 ≠ ∅)
42, 3bitr3i 279 . 2 (∃𝑥𝐴 𝐵 = ∅ ↔ ¬ ∀𝑥𝐴 𝐵 ≠ ∅)
5 ixpn0 8496 . . 3 (X𝑥𝐴 𝐵 ≠ ∅ → ∀𝑥𝐴 𝐵 ≠ ∅)
65necon1bi 3046 . 2 (¬ ∀𝑥𝐴 𝐵 ≠ ∅ → X𝑥𝐴 𝐵 = ∅)
74, 6sylbi 219 1 (∃𝑥𝐴 𝐵 = ∅ → X𝑥𝐴 𝐵 = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1537  wne 3018  wral 3140  wrex 3141  c0 4293  Xcixp 8463
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-11 2161  ax-12 2177  ax-ext 2795
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-dif 3941  df-nul 4294  df-ixp 8464
This theorem is referenced by:  vonioo  42971  vonicc  42974
  Copyright terms: Public domain W3C validator