Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mo2dc | Unicode version |
Description: Alternate definition of "at most one" where existence is decidable. (Contributed by Jim Kingdon, 2-Jul-2018.) |
Ref | Expression |
---|---|
mo2dc.1 |
Ref | Expression |
---|---|
mo2dc | DECID |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mo2dc.1 | . . 3 | |
2 | 1 | modc 1943 | . 2 DECID |
3 | 1 | nfri 1412 | . . 3 |
4 | 3 | mo3h 1953 | . 2 |
5 | 2, 4 | syl6rbbr 188 | 1 DECID |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 DECID wdc 742 wal 1241 wnf 1349 wex 1381 wsb 1645 wmo 1901 |
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 |
This theorem depends on definitions: df-bi 110 df-dc 743 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |