Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > uni0b | Structured version Visualization version GIF version |
Description: The union of a set is empty iff the set is included in the singleton of the empty set. (Contributed by NM, 12-Sep-2004.) |
Ref | Expression |
---|---|
uni0b | ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | velsn 4141 | . . 3 ⊢ (𝑥 ∈ {∅} ↔ 𝑥 = ∅) | |
2 | 1 | ralbii 2963 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ∈ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
3 | dfss3 3558 | . 2 ⊢ (𝐴 ⊆ {∅} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {∅}) | |
4 | neq0 3889 | . . . 4 ⊢ (¬ ∪ 𝐴 = ∅ ↔ ∃𝑦 𝑦 ∈ ∪ 𝐴) | |
5 | rexcom4 3198 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 ∈ 𝑥 ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥) | |
6 | neq0 3889 | . . . . . 6 ⊢ (¬ 𝑥 = ∅ ↔ ∃𝑦 𝑦 ∈ 𝑥) | |
7 | 6 | rexbii 3023 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝑥 = ∅ ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 ∈ 𝑥) |
8 | eluni2 4376 | . . . . . 6 ⊢ (𝑦 ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥) | |
9 | 8 | exbii 1764 | . . . . 5 ⊢ (∃𝑦 𝑦 ∈ ∪ 𝐴 ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥) |
10 | 5, 7, 9 | 3bitr4ri 292 | . . . 4 ⊢ (∃𝑦 𝑦 ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ¬ 𝑥 = ∅) |
11 | rexnal 2978 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝑥 = ∅ ↔ ¬ ∀𝑥 ∈ 𝐴 𝑥 = ∅) | |
12 | 4, 10, 11 | 3bitri 285 | . . 3 ⊢ (¬ ∪ 𝐴 = ∅ ↔ ¬ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
13 | 12 | con4bii 310 | . 2 ⊢ (∪ 𝐴 = ∅ ↔ ∀𝑥 ∈ 𝐴 𝑥 = ∅) |
14 | 2, 3, 13 | 3bitr4ri 292 | 1 ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅}) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 195 = wceq 1475 ∃wex 1695 ∈ wcel 1977 ∀wral 2896 ∃wrex 2897 ⊆ wss 3540 ∅c0 3874 {csn 4125 ∪ cuni 4372 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-v 3175 df-dif 3543 df-in 3547 df-ss 3554 df-nul 3875 df-sn 4126 df-uni 4373 |
This theorem is referenced by: uni0c 4400 uni0 4401 fin1a2lem11 9115 zornn0g 9210 0top 20598 filcon 21497 alexsubALTlem2 21662 ordcmp 31616 unisn0 38247 |
Copyright terms: Public domain | W3C validator |