| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: In the Separation Scheme
zfauscl 2695, we require that |
| Ref | Expression |
|---|---|
| notzfaus.1 |
|
| notzfaus.2 |
|
| Ref | Expression |
|---|---|
| notzfaus |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ex 2701 |
. . . . . . 7
| |
| 2 | 1 | snnz 2449 |
. . . . . 6
|
| 3 | notzfaus.1 |
. . . . . . 7
| |
| 4 | 3 | neeq1i 1584 |
. . . . . 6
|
| 5 | 2, 4 | mpbir 190 |
. . . . 5
|
| 6 | ne0 2278 |
. . . . 5
| |
| 7 | 5, 6 | mpbi 189 |
. . . 4
|
| 8 | biimt 729 |
. . . . . . 7
| |
| 9 | iman 237 |
. . . . . . . 8
| |
| 10 | notzfaus.2 |
. . . . . . . . . 10
| |
| 11 | 10 | anbi2i 479 |
. . . . . . . . 9
|
| 12 | 11 | negbii 187 |
. . . . . . . 8
|
| 13 | 9, 12 | bitr4 176 |
. . . . . . 7
|
| 14 | 8, 13 | syl6bb 534 |
. . . . . 6
|
| 15 | xor3 672 |
. . . . . 6
| |
| 16 | 14, 15 | sylibr 200 |
. . . . 5
|
| 17 | 16 | 19.22i 1036 |
. . . 4
|
| 18 | 7, 17 | ax-mp 7 |
. . 3
|
| 19 | exnal 1034 |
. . 3
| |
| 20 | 18, 19 | mpbi 189 |
. 2
|
| 21 | 20 | nex 1097 |
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 959 ax-gen 960 ax-8 961 ax-10 963 ax-11 964 ax-12 965 ax-14 967 ax-17 968 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 ax-10o 1136 ax-16 1206 ax-11o 1213 ax-ext 1452 ax-nul 2700 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 978 df-sb 1168 df-eu 1375 df-mo 1376 df-clab 1457 df-cleq 1462 df-clel 1465 df-ne 1579 df-v 1803 df-dif 2039 df-un 2040 df-nul 2271 df-sn 2402 df-pr 2403 |