![]() |
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 9894. (Contributed by NM, 1-Oct-2006.) (Proof shortened by Mario Carneiro, 22-Jun-2016.) |
Ref | Expression |
---|---|
ixp0 | ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → X𝑥 ∈ 𝐴 𝐵 = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nne 2991 | . . . 4 ⊢ (¬ 𝐵 ≠ ∅ ↔ 𝐵 = ∅) | |
2 | 1 | rexbii 3210 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝐵 ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝐵 = ∅) |
3 | rexnal 3201 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝐵 ≠ ∅ ↔ ¬ ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) | |
4 | 2, 3 | bitr3i 280 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ ↔ ¬ ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
5 | ixpn0 8477 | . . 3 ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) | |
6 | 5 | necon1bi 3015 | . 2 ⊢ (¬ ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → X𝑥 ∈ 𝐴 𝐵 = ∅) |
7 | 4, 6 | sylbi 220 | 1 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → X𝑥 ∈ 𝐴 𝐵 = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1538 ≠ wne 2987 ∀wral 3106 ∃wrex 3107 ∅c0 4243 Xcixp 8444 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-tru 1541 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ne 2988 df-ral 3111 df-rex 3112 df-dif 3884 df-nul 4244 df-ixp 8445 |
This theorem is referenced by: vonioo 43321 vonicc 43324 |
Copyright terms: Public domain | W3C validator |