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

Theorem ixp0 8489
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 9899. (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 3020 . . . 4 𝐵 ≠ ∅ ↔ 𝐵 = ∅)
21rexbii 3247 . . 3 (∃𝑥𝐴 ¬ 𝐵 ≠ ∅ ↔ ∃𝑥𝐴 𝐵 = ∅)
3 rexnal 3238 . . 3 (∃𝑥𝐴 ¬ 𝐵 ≠ ∅ ↔ ¬ ∀𝑥𝐴 𝐵 ≠ ∅)
42, 3bitr3i 279 . 2 (∃𝑥𝐴 𝐵 = ∅ ↔ ¬ ∀𝑥𝐴 𝐵 ≠ ∅)
5 ixpn0 8488 . . 3 (X𝑥𝐴 𝐵 ≠ ∅ → ∀𝑥𝐴 𝐵 ≠ ∅)
65necon1bi 3044 . 2 (¬ ∀𝑥𝐴 𝐵 ≠ ∅ → X𝑥𝐴 𝐵 = ∅)
74, 6sylbi 219 1 (∃𝑥𝐴 𝐵 = ∅ → X𝑥𝐴 𝐵 = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1533  wne 3016  wral 3138  wrex 3139  c0 4290  Xcixp 8455
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-11 2157  ax-12 2173  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-dif 3938  df-nul 4291  df-ixp 8456
This theorem is referenced by:  vonioo  42958  vonicc  42961
  Copyright terms: Public domain W3C validator