| 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 4704. (Contributed by Jim Kingdon, 29-Dec-2018.) |
| Ref | Expression |
|---|---|
| dtru | ⊢ ¬ ∀𝑥 𝑥 = 𝑦 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dtruex 4704 | . 2 ⊢ ∃𝑥 ¬ 𝑥 = 𝑦 | |
| 2 | exnalim 1699 | . 2 ⊢ (∃𝑥 ¬ 𝑥 = 𝑦 → ¬ ∀𝑥 𝑥 = 𝑦) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ¬ ∀𝑥 𝑥 = 𝑦 |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ∀wal 1400 ∃wex 1545 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-setind 4682 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-v 2823 df-dif 3222 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 |
| This theorem is referenced by: oprabidlem 6110 |
| Copyright terms: Public domain | W3C validator |