Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > eq0 | GIF version |
Description: The empty set has no elements. Theorem 2 of [Suppes] p. 22. (Contributed by NM, 29-Aug-1993.) |
Ref | Expression |
---|---|
eq0 | ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2178 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
2 | nfcv 2178 | . . 3 ⊢ Ⅎ𝑥∅ | |
3 | 1, 2 | cleqf 2201 | . 2 ⊢ (𝐴 = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
4 | noel 3228 | . . . 4 ⊢ ¬ 𝑥 ∈ ∅ | |
5 | 4 | nbn 615 | . . 3 ⊢ (¬ 𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
6 | 5 | albii 1359 | . 2 ⊢ (∀𝑥 ¬ 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
7 | 3, 6 | bitr4i 176 | 1 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 ↔ wb 98 ∀wal 1241 = wceq 1243 ∈ wcel 1393 ∅c0 3224 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-v 2559 df-dif 2920 df-nul 3225 |
This theorem is referenced by: 0el 3241 rabeq0 3247 abeq0 3248 ssdif0im 3286 inssdif0im 3291 ralf0 3324 snprc 3435 uni0b 3605 0ex 3884 dm0 4549 reldm0 4553 dmsn0 4788 dmsn0el 4790 fzo0 9024 fzouzdisj 9036 |
Copyright terms: Public domain | W3C validator |