| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Commutation of restricted quantifiers. |
| Ref | Expression |
|---|---|
| rexcom |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ancom 435 |
. . . . 5
| |
| 2 | 1 | anbi1i 481 |
. . . 4
|
| 3 | 2 | 2exbii 1052 |
. . 3
|
| 4 | excom 1046 |
. . 3
| |
| 5 | 3, 4 | bitr 173 |
. 2
|
| 6 | r2ex 1691 |
. 2
| |
| 7 | r2ex 1691 |
. 2
| |
| 8 | 5, 6, 7 | 3bitr4 183 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: rexcom4 1824 brdom7disj 4804 creui 6743 shscomt 9283 mdsymlem4 10333 mdsymlem8 10337 |
| 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-17 971 ax-4 973 ax-5o 975 ax-6o 978 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 981 df-rex 1650 |