| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: In the Separation Scheme
zfauscl 2700, we require that |
| Ref | Expression |
|---|---|
| notzfaus.1 |
|
| notzfaus.2 |
|
| Ref | Expression |
|---|---|
| notzfaus |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ex 2706 |
. . . . . . 7
| |
| 2 | 1 | snnz 2454 |
. . . . . 6
|
| 3 | notzfaus.1 |
. . . . . . 7
| |
| 4 | 3 | neeq1i 1589 |
. . . . . 6
|
| 5 | 2, 4 | mpbir 190 |
. . . . 5
|
| 6 | ne0 2284 |
. . . . 5
| |
| 7 | 5, 6 | mpbi 189 |
. . . 4
|
| 8 | biimt 730 |
. . . . . . 7
| |
| 9 | iman 237 |
. . . . . . . 8
| |
| 10 | notzfaus.2 |
. . . . . . . . . 10
| |
| 11 | 10 | anbi2i 480 |
. . . . . . . . 9
|
| 12 | 11 | negbii 187 |
. . . . . . . 8
|
| 13 | 9, 12 | bitr4 176 |
. . . . . . 7
|
| 14 | 8, 13 | syl6bb 535 |
. . . . . 6
|
| 15 | xor3 673 |
. . . . . 6
| |
| 16 | 14, 15 | sylibr 200 |
. . . . 5
|
| 17 | 16 | 19.22i 1038 |
. . . 4
|
| 18 | 7, 17 | ax-mp 7 |
. . 3
|
| 19 | exnal 1036 |
. . 3
| |
| 20 | 18, 19 | mpbi 189 |
. 2
|
| 21 | 20 | nex 1099 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 960 ax-gen 961 ax-8 962 ax-10 964 ax-11 965 ax-12 966 ax-14 968 ax-17 969 ax-4 971 ax-5o 973 ax-6o 976 ax-9o 1121 ax-10o 1138 ax-16 1208 ax-11o 1216 ax-ext 1457 ax-nul 2705 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 979 df-sb 1170 df-eu 1380 df-mo 1381 df-clab 1462 df-cleq 1467 df-clel 1470 df-ne 1584 df-v 1808 df-dif 2045 df-un 2046 df-nul 2277 df-sn 2408 df-pr 2409 |