| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: The membership relation is irreflexive: no set is a member of itself. Theorem 105 of [Suppes] p. 54. (This is trivial to prove from zfregfr 4687 and efrirr 2983, but this proof is direct from the Axiom of Regularity.) |
| Ref | Expression |
|---|---|
| elirrv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 1571 |
. . . 4
| |
| 2 | visset 1851 |
. . . . 5
| |
| 3 | 2 | snid 2480 |
. . . 4
|
| 4 | 1, 3 | a4eiv 1307 |
. . 3
|
| 5 | snex 2802 |
. . . 4
| |
| 6 | 5 | zfregcl 4679 |
. . 3
|
| 7 | 4, 6 | ax-mp 7 |
. 2
|
| 8 | ax-14 1002 |
. . . . . . . . 9
| |
| 9 | 8 | equcoms 1163 |
. . . . . . . 8
|
| 10 | 9 | com12 11 |
. . . . . . 7
|
| 11 | elsn 2466 |
. . . . . . 7
| |
| 12 | 10, 11 | syl5ib 204 |
. . . . . 6
|
| 13 | eleq1 1571 |
. . . . . . . . 9
| |
| 14 | 13 | notbid 613 |
. . . . . . . 8
|
| 15 | 14 | rcla4cv 1912 |
. . . . . . 7
|
| 16 | 3, 15 | mt2i 109 |
. . . . . 6
|
| 17 | 12, 16 | nsyli 120 |
. . . . 5
|
| 18 | 17 | con2d 91 |
. . . 4
|
| 19 | 18 | r19.21aiv 1751 |
. . 3
|
| 20 | ralnex 1691 |
. . 3
| |
| 21 | 19, 20 | sylib 196 |
. 2
|
| 22 | 7, 21 | mt2 108 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: elirr 4683 ruv 4685 aceq6b 4828 nd1 5027 nd2 5028 nd3 5029 axunnd 5037 axregndlem1 5043 axregndlem2 5044 axregnd 5045 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 994 ax-gen 995 ax-8 996 ax-10 998 ax-11 999 ax-12 1000 ax-13 1001 ax-14 1002 ax-17 1003 ax-4 1005 ax-5o 1007 ax-6o 1010 ax-9o 1155 ax-10o 1173 ax-16 1243 ax-11o 1251 ax-ext 1494 ax-sep 2754 ax-pow 2794 ax-reg 4677 |
| This theorem depends on definitions: df-bi 145 df-or 222 df-an 223 df-ex 1013 df-sb 1205 df-eu 1415 df-mo 1416 df-clab 1500 df-cleq 1505 df-clel 1508 df-ne 1624 df-ral 1687 df-rex 1688 df-v 1850 df-dif 2093 df-un 2094 df-in 2095 df-ss 2097 df-nul 2325 df-pw 2447 df-sn 2457 df-pr 2458 |