| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ixp0 | Structured version Visualization version GIF version | ||
| 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 10396. (Contributed by NM, 1-Oct-2006.) (Proof shortened by Mario Carneiro, 22-Jun-2016.) |
| Ref | Expression |
|---|---|
| ixp0 | ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → X𝑥 ∈ 𝐴 𝐵 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nne 2938 | . . . 4 ⊢ (¬ 𝐵 ≠ ∅ ↔ 𝐵 = ∅) | |
| 2 | 1 | rexbii 3086 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝐵 ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝐵 = ∅) |
| 3 | rexnal 3091 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝐵 ≠ ∅ ↔ ¬ ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) | |
| 4 | 2, 3 | bitr3i 278 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ ↔ ¬ ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
| 5 | ixpn0 8868 | . . 3 ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) | |
| 6 | 5 | necon1bi 2962 | . 2 ⊢ (¬ ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → X𝑥 ∈ 𝐴 𝐵 = ∅) |
| 7 | 4, 6 | sylbi 218 | 1 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → X𝑥 ∈ 𝐴 𝐵 = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1547 ≠ wne 2934 ∀wral 3053 ∃wrex 3063 ∅c0 4261 Xcixp 8835 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-12 2189 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ne 2935 df-ral 3054 df-rex 3064 df-dif 3886 df-nul 4262 df-ixp 8836 |
| This theorem is referenced by: vonioo 47125 vonicc 47128 |
| Copyright terms: Public domain | W3C validator |