| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Any set is the smallest of all sets that include it. |
| Ref | Expression |
|---|---|
| intmin2.1 |
|
| Ref | Expression |
|---|---|
| intmin2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rabab 1869 |
. . 3
| |
| 2 | 1 | inteqi 2591 |
. 2
|
| 3 | intmin2.1 |
. . 3
| |
| 4 | intmin 2607 |
. . 3
| |
| 5 | 3, 4 | ax-mp 7 |
. 2
|
| 6 | 2, 5 | eqtr3i 1544 |
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 1003 ax-gen 1004 ax-8 1005 ax-10 1007 ax-12 1009 ax-17 1012 ax-4 1014 ax-5o 1016 ax-6o 1019 ax-9o 1164 ax-10o 1182 ax-16 1252 ax-11o 1260 ax-ext 1504 |
| This theorem depends on definitions: df-bi 154 df-an 232 df-ex 1022 df-sb 1214 df-clab 1510 df-cleq 1515 df-clel 1518 df-ral 1696 df-rab 1699 df-v 1859 df-in 2102 df-ss 2104 df-int 2588 |