| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Removal of negation from substitution. |
| Ref | Expression |
|---|---|
| sbn1 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ2 864 |
. . . 4
| |
| 2 | sbequ2 864 |
. . . . 5
| |
| 3 | 2 | con3d 87 |
. . . 4
|
| 4 | 1, 3 | syld 27 |
. . 3
|
| 5 | 4 | a4s 682 |
. 2
|
| 6 | sb4 861 |
. . 3
| |
| 7 | sb1 858 |
. . . . 5
| |
| 8 | eqs3 830 |
. . . . 5
| |
| 9 | 7, 8 | sylib 173 |
. . . 4
|
| 10 | 9 | con2i 89 |
. . 3
|
| 11 | 6, 10 | syl6 23 |
. 2
|
| 12 | 5, 11 | pm2.61i 110 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbn 882 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 df-sb 853 |