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 4857 | . 2 ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅}) | |
2 | dfss3 3956 | . 2 ⊢ (𝐴 ⊆ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {∅}) | |
3 | velsn 4577 | . . 3 ⊢ (𝑥 ∈ {∅} ↔ 𝑥 = ∅) | |
4 | 3 | ralbii 3165 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ∈ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
5 | 1, 2, 4 | 3bitri 299 | 1 ⊢ (∪ 𝐴 = ∅ ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 = wceq 1533 ∈ wcel 2110 ∀wral 3138 ⊆ wss 3936 ∅c0 4291 {csn 4561 ∪ cuni 4832 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-v 3497 df-dif 3939 df-in 3943 df-ss 3952 df-nul 4292 df-sn 4562 df-uni 4833 |
This theorem is referenced by: fin1a2lem13 9828 fctop 21606 cctop 21608 ssmxidllem 30973 |
Copyright terms: Public domain | W3C validator |