![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > en0 | Unicode version |
Description: The empty set is equinumerous only to itself. Exercise 1 of [TakeutiZaring] p. 88. (Contributed by NM, 27-May-1998.) |
Ref | Expression |
---|---|
en0 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bren 6764 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | f1ocnv 5488 |
. . . . 5
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | f1o00 5510 |
. . . . . 6
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
4 | 3 | simprbi 275 |
. . . . 5
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
5 | 2, 4 | syl 14 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
6 | 5 | exlimiv 1608 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 1, 6 | sylbi 121 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
8 | 0ex 4144 |
. . . 4
![]() ![]() ![]() ![]() | |
9 | 8 | enref 6782 |
. . 3
![]() ![]() ![]() ![]() |
10 | breq1 4020 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
11 | 9, 10 | mpbiri 168 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
12 | 7, 11 | impbii 126 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2161 ax-14 2162 ax-ext 2170 ax-sep 4135 ax-nul 4143 ax-pow 4188 ax-pr 4223 ax-un 4447 |
This theorem depends on definitions: df-bi 117 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2040 df-mo 2041 df-clab 2175 df-cleq 2181 df-clel 2184 df-nfc 2320 df-ral 2472 df-rex 2473 df-v 2753 df-dif 3145 df-un 3147 df-in 3149 df-ss 3156 df-nul 3437 df-pw 3591 df-sn 3612 df-pr 3613 df-op 3615 df-uni 3824 df-br 4018 df-opab 4079 df-id 4307 df-xp 4646 df-rel 4647 df-cnv 4648 df-co 4649 df-dm 4650 df-rn 4651 df-res 4652 df-ima 4653 df-fun 5232 df-fn 5233 df-f 5234 df-f1 5235 df-fo 5236 df-f1o 5237 df-en 6758 |
This theorem is referenced by: nneneq 6874 php5 6875 snnen2oprc 6877 php5dom 6880 ssfilem 6892 dif1enen 6897 fin0 6902 fin0or 6903 diffitest 6904 findcard 6905 findcard2 6906 findcard2s 6907 diffisn 6910 fiintim 6945 fisseneq 6948 fihasheq0 10790 zfz1iso 10838 |
Copyright terms: Public domain | W3C validator |