| 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 4045 |
. . . 4
|
| 5 | 4 | eleq1d 1540 |
. . 3
|
| 6 | 1, 5 | mtbiri 717 |
. 2
|
| 7 | 6 | a3i 74 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ndmoprass 4048 ndmoprdistr 4049 ndmord 4050 ndmordi 4051 caoprmo 4070 brecop2 4307 eceqopreq 4313 mulcanpi 5027 recclpq 5072 ltexpq 5080 ltexpq2 5081 nsmallpq 5083 ltbtwnpq 5084 ltaddpr 5140 ltaddpr2 5141 ltexprlem2 5143 ltexprlem3 5144 ltexprlem4 5145 ltexprlem6 5147 ltexprlem7 5148 ltexpri 5149 addcanpr 5152 recexpr 5160 recexsrlem 5212 mappsrpr 5218 supsrlem1 5225 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-10 966 ax-11 967 ax-12 968 ax-13 969 ax-14 970 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-10o 1140 ax-16 1210 ax-11o 1218 ax-ext 1459 ax-sep 2703 ax-pow 2742 ax-pr 2779 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3an 777 df-ex 981 df-sb 1172 df-eu 1382 df-mo 1383 df-clab 1464 df-cleq 1469 df-clel 1472 df-ne 1587 df-ral 1649 df-rex 1650 df-v 1812 df-dif 2049 df-un 2050 df-in 2051 df-ss 2053 df-nul 2281 df-pw 2402 df-sn 2412 df-pr 2413 df-op 2416 df-uni 2504 df-br 2620 df-opab 2667 df-xp 3184 df-cnv 3186 df-dm 3188 df-rn 3189 df-res 3190 df-ima 3191 df-fv 3198 df-opr 3965 |