| 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 4901 | . 2 ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅}) | |
| 2 | dfss3 3927 | . 2 ⊢ (𝐴 ⊆ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {∅}) | |
| 3 | velsn 4607 | . . 3 ⊢ (𝑥 ∈ {∅} ↔ 𝑥 = ∅) | |
| 4 | 3 | ralbii 3113 | . 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 2146 ∀wral 3081 ⊆ wss 3906 ∅c0 4286 {csn 4591 ∪ cuni 4874 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-11 2195 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rex 3092 df-v 3459 df-dif 3909 df-ss 3923 df-nul 4287 df-sn 4592 df-uni 4875 |
| This theorem is used by: fin1a2lem13 10407 ssdifidllem 21513 fctop 23190 cctop 23192 ssmxidllem 33779 |
| Copyright terms: Public domain | W3C validator |