| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Double restricted universal quantification. |
| Ref | Expression |
|---|---|
| r2al |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ral 1646 |
. 2
| |
| 2 | 19.21v 1283 |
. . . 4
| |
| 3 | impexp 347 |
. . . . 5
| |
| 4 | 3 | albii 997 |
. . . 4
|
| 5 | df-ral 1646 |
. . . . 5
| |
| 6 | 5 | imbi2i 185 |
. . . 4
|
| 7 | 2, 4, 6 | 3bitr4 183 |
. . 3
|
| 8 | 7 | albii 997 |
. 2
|
| 9 | 1, 8 | bitr4 176 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: r3al 1687 ralcom 1771 soss 2847 dfwe2 2930 weinxp 3228 fununi 3555 f1fv 3865 tz7.48lem 3946 tz7.49 3950 inf3lem6 4598 zorn2lem4 4771 zorn2lem6 4773 projlem28 9152 imonclem 10619 ismonc 10620 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 961 ax-17 969 ax-4 971 ax-5o 973 ax-6o 976 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ral 1646 |