| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Introduction of negation into substitution. |
| Ref | Expression |
|---|---|
| sbn2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ1 863 |
. . . . 5
| |
| 2 | 1 | con3d 87 |
. . . 4
|
| 3 | 2 | com12 13 |
. . 3
|
| 4 | sb2 859 |
. . . . . 6
| |
| 5 | pm4.13 142 |
. . . . . . 7
| |
| 6 | 5 | bisb 855 |
. . . . . 6
|
| 7 | 4, 6 | sylibr 175 |
. . . . 5
|
| 8 | 7 | con3i 90 |
. . . 4
|
| 9 | eqs3 830 |
. . . 4
| |
| 10 | 8, 9 | sylibr 175 |
. . 3
|
| 11 | 3, 10 | jca 236 |
. 2
|
| 12 | df-sb 853 |
. 2
| |
| 13 | 11, 12 | sylibr 175 |
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-gen 677 ax-9 799 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 df-sb 853 |