Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dvelim | Unicode version |
Description: This theorem can be used
to eliminate a distinct variable restriction on
and and replace it with the
"distinctor"
as an antecedent. normally has free and can be read
, and
substitutes for and can be read
. We don't require that and be
distinct: if
they aren't, the distinctor will become false (in multiple-element
domains of discourse) and "protect" the consequent.
To obtain a closed-theorem form of this inference, prefix the hypotheses with , conjoin them, and apply dvelimdf 2009. Other variants of this theorem are dvelimf 2008 (with no distinct variable restrictions) and dvelimALT 2003 (that avoids ax-10 1498). (Contributed by NM, 23-Nov-1994.) |
Ref | Expression |
---|---|
dvelim.1 | |
dvelim.2 |
Ref | Expression |
---|---|
dvelim |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dvelim.1 | . 2 | |
2 | ax-17 1519 | . 2 | |
3 | dvelim.2 | . 2 | |
4 | 1, 2, 3 | dvelimf 2008 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wb 104 wal 1346 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 |
This theorem depends on definitions: df-bi 116 df-nf 1454 df-sb 1756 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |