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 10239. (Contributed by NM, 1-Oct-2006.) (Proof shortened by Mario Carneiro, 22-Jun-2016.) |
Ref | Expression |
---|---|
ixp0 | ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → X𝑥 ∈ 𝐴 𝐵 = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nne 2947 | . . . 4 ⊢ (¬ 𝐵 ≠ ∅ ↔ 𝐵 = ∅) | |
2 | 1 | rexbii 3181 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝐵 ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝐵 = ∅) |
3 | rexnal 3169 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝐵 ≠ ∅ ↔ ¬ ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) | |
4 | 2, 3 | bitr3i 276 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ ↔ ¬ ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
5 | ixpn0 8718 | . . 3 ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) | |
6 | 5 | necon1bi 2972 | . 2 ⊢ (¬ ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → X𝑥 ∈ 𝐴 𝐵 = ∅) |
7 | 4, 6 | sylbi 216 | 1 ⊢ (∃𝑥 ∈ 𝐴 𝐵 = ∅ → X𝑥 ∈ 𝐴 𝐵 = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1539 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 ∅c0 4256 Xcixp 8685 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rex 3070 df-dif 3890 df-nul 4257 df-ixp 8686 |
This theorem is referenced by: vonioo 44220 vonicc 44223 |
Copyright terms: Public domain | W3C validator |