![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > iunn0 | Structured version Visualization version GIF version |
Description: There is a nonempty class in an indexed collection 𝐵(𝑥) iff the indexed union of them is nonempty. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
Ref | Expression |
---|---|
iunn0 | ⊢ (∃𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∪ 𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rexcom4 3329 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 ∈ 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
2 | eliun 4632 | . . . 4 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
3 | 2 | exbii 1887 | . . 3 ⊢ (∃𝑦 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) |
4 | 1, 3 | bitr4i 267 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 ∈ 𝐵 ↔ ∃𝑦 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) |
5 | n0 4039 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵) | |
6 | 5 | rexbii 3143 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 ∈ 𝐵) |
7 | n0 4039 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) | |
8 | 4, 6, 7 | 3bitr4i 292 | 1 ⊢ (∃𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∪ 𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∃wex 1817 ∈ wcel 2103 ≠ wne 2896 ∃wrex 3015 ∅c0 4023 ∪ ciun 4628 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1835 ax-4 1850 ax-5 1952 ax-6 2018 ax-7 2054 ax-9 2112 ax-10 2132 ax-11 2147 ax-12 2160 ax-13 2355 ax-ext 2704 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-tru 1599 df-ex 1818 df-nf 1823 df-sb 2011 df-clab 2711 df-cleq 2717 df-clel 2720 df-nfc 2855 df-ne 2897 df-ral 3019 df-rex 3020 df-v 3306 df-dif 3683 df-nul 4024 df-iun 4630 |
This theorem is referenced by: fsuppmapnn0fiubex 12907 lbsextlem2 19282 |
Copyright terms: Public domain | W3C validator |