| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dtru | GIF version | ||
| Description: At least two sets exist (or in terms of first-order logic, the universe of discourse has two or more objects). If we assumed the law of the excluded middle this would be equivalent to dtruex 4686. (Contributed by Jim Kingdon, 29-Dec-2018.) |
| Ref | Expression |
|---|---|
| dtru | ⊢ ¬ ∀𝑥 𝑥 = 𝑦 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dtruex 4686 | . 2 ⊢ ∃𝑥 ¬ 𝑥 = 𝑦 | |
| 2 | exnalim 1695 | . 2 ⊢ (∃𝑥 ¬ 𝑥 = 𝑦 → ¬ ∀𝑥 𝑥 = 𝑦) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ¬ ∀𝑥 𝑥 = 𝑦 |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ∀wal 1396 ∃wex 1541 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-setind 4664 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-v 2817 df-dif 3216 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 |
| This theorem is referenced by: oprabidlem 6089 |
| Copyright terms: Public domain | W3C validator |