| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ixpn0 | 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 10434. (Contributed by Mario Carneiro, 22-Jun-2016.) |
| Ref | Expression |
|---|---|
| ixpn0 | ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4303 | . 2 ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∃𝑓 𝑓 ∈ X𝑥 ∈ 𝐴 𝐵) | |
| 2 | df-ixp 8874 | . . . . 5 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑓 ∣ (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} | |
| 3 | 2 | eqabri 2903 | . . . 4 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)) |
| 4 | ne0i 4291 | . . . . 5 ⊢ ((𝑓‘𝑥) ∈ 𝐵 → 𝐵 ≠ ∅) | |
| 5 | 4 | ralimi 3098 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵 → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
| 6 | 3, 5 | simplbiim 512 | . . 3 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐴 𝐵 → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
| 7 | 6 | exlimiv 1949 | . 2 ⊢ (∃𝑓 𝑓 ∈ X𝑥 ∈ 𝐴 𝐵 → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
| 8 | 1, 7 | sylbi 219 | 1 ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∃wex 1798 ∈ wcel 2141 {cab 2739 ≠ wne 2956 ∀wral 3075 ∅c0 4283 Fn wfn 6511 ‘cfv 6516 Xcixp 8873 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-12 2211 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-dif 3905 df-nul 4284 df-ixp 8874 |
| This theorem is referenced by: ixp0 8907 ac9 10434 ac9s 10444 |
| Copyright terms: Public domain | W3C validator |