| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dedth4v | Structured version Visualization version Unicode version | ||
| Description: Weak deduction theorem for eliminating a hypothesis with 4 class variables. See comments in dedth2v 4143. (Contributed by NM, 21-Apr-2007.) (Proof shortened by Eric Schmidt, 28-Jul-2009.) |
| Ref | Expression |
|---|---|
| dedth4v.1 |
|
| dedth4v.2 |
|
| dedth4v.3 |
|
| dedth4v.4 |
|
| dedth4v.5 |
|
| Ref | Expression |
|---|---|
| dedth4v |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dedth4v.1 |
. . . 4
| |
| 2 | dedth4v.2 |
. . . 4
| |
| 3 | dedth4v.3 |
. . . 4
| |
| 4 | dedth4v.4 |
. . . 4
| |
| 5 | dedth4v.5 |
. . . 4
| |
| 6 | 1, 2, 3, 4, 5 | dedth4h 4142 |
. . 3
|
| 7 | 6 | anidms 677 |
. 2
|
| 8 | 7 | anidms 677 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
| This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-if 4087 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |