| 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 4899 | . 2 ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅}) | |
| 2 | dfss3 3902 | . 2 ⊢ (𝐴 ⊆ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {∅}) | |
| 3 | velsn 4600 | . . 3 ⊢ (𝑥 ∈ {∅} ↔ 𝑥 = ∅) | |
| 4 | 3 | ralbii 3112 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ∈ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
| 5 | 1, 2, 4 | 3bitri 300 | 1 ⊢ (∪ 𝐴 = ∅ ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ⊆ wss 3900 ∅c0 4281 {csn 4588 ∪ cuni 4872 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-11 2197 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-v 3456 df-ss 3901 df-dif 4050 df-nul 4282 df-sn 4589 df-uni 4873 |
| This theorem is used by: fin1a2lem13 10529 ssdifidllem 21691 fctop 23377 cctop 23379 ssmxidllem 34102 |
| Copyright terms: Public domain | W3C validator |