| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Reverse closure law, when an operation's domain doesn't contain the empty set. |
| Ref | Expression |
|---|---|
| ndmopr.1 |
|
| ndmopr.2 |
|
| ndmoprrcl.3 |
|
| Ref | Expression |
|---|---|
| ndmoprrcl |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ndmoprrcl.3 |
. . 3
| |
| 2 | ndmopr.1 |
. . . . 5
| |
| 3 | ndmopr.2 |
. . . . 5
| |
| 4 | 2, 3 | ndmopr 4031 |
. . . 4
|
| 5 | 4 | eleq1d 1532 |
. . 3
|
| 6 | 1, 5 | mtbiri 715 |
. 2
|
| 7 | 6 | a3i 74 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ndmoprass 4034 ndmoprdistr 4035 ndmord 4036 ndmordi 4037 caoprmo 4056 brecop2 4291 eceqopreq 4297 mulcanpi 4999 recclpq 5044 ltexpq 5052 ltexpq2 5053 nsmallpq 5055 ltbtwnpq 5056 ltaddpr 5112 ltaddpr2 5113 ltexprlem2 5115 ltexprlem3 5116 ltexprlem4 5117 ltexprlem6 5119 ltexprlem7 5120 ltexpri 5121 addcanpr 5124 recexpr 5132 recexsrlem 5184 mappsrpr 5190 supsrlem1 5197 |
| 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-13 966 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-sep 2693 ax-pow 2732 ax-pr 2769 |
| 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-ral 1641 df-rex 1642 df-v 1803 df-dif 2039 df-un 2040 df-in 2041 df-ss 2043 df-nul 2271 df-pw 2392 df-sn 2402 df-pr 2403 df-op 2406 df-uni 2494 df-br 2610 df-opab 2657 df-xp 3174 df-cnv 3176 df-dm 3178 df-rn 3179 df-res 3180 df-ima 3181 df-fv 3188 df-opr 3950 |