| 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 4889 | . 2 ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅}) | |
| 2 | dfss3 3923 | . 2 ⊢ (𝐴 ⊆ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {∅}) | |
| 3 | velsn 4595 | . . 3 ⊢ (𝑥 ∈ {∅} ↔ 𝑥 = ∅) | |
| 4 | 3 | ralbii 3107 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ∈ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
| 5 | 1, 2, 4 | 3bitri 299 | 1 ⊢ (∪ 𝐴 = ∅ ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 = wceq 1559 ∈ wcel 2141 ∀wral 3075 ⊆ wss 3902 ∅c0 4283 {csn 4579 ∪ cuni 4862 |
| 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-11 2190 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-ral 3076 df-rex 3086 df-v 3455 df-dif 3905 df-ss 3919 df-nul 4284 df-sn 4580 df-uni 4863 |
| This theorem is referenced by: fin1a2lem13 10362 fctop 23051 cctop 23053 ssdifidllem 33603 ssmxidllem 33621 |
| Copyright terms: Public domain | W3C validator |