| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uni0c | Structured version Visualization version GIF version | ||
| Description: The union of a set is empty iff all of its members are empty. (Contributed by NM, 16-Aug-2006.) |
| Ref | Expression |
|---|---|
| uni0c | ⊢ (∪ 𝐴 = ∅ ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uni0b 4900 | . 2 ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅}) | |
| 2 | dfss3 3927 | . 2 ⊢ (𝐴 ⊆ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {∅}) | |
| 3 | velsn 4606 | . . 3 ⊢ (𝑥 ∈ {∅} ↔ 𝑥 = ∅) | |
| 4 | 3 | ralbii 3111 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ∈ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
| 5 | 1, 2, 4 | 3bitri 300 | 1 ⊢ (∪ 𝐴 = ∅ ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ⊆ wss 3906 ∅c0 4287 {csn 4590 ∪ cuni 4873 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-11 2192 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-v 3457 df-dif 3909 df-ss 3923 df-nul 4288 df-sn 4591 df-uni 4874 |
| This theorem is referenced by: fin1a2lem13 10397 ssdifidllem 21465 fctop 23142 cctop 23144 ssmxidllem 33737 |
| Copyright terms: Public domain | W3C validator |