| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Commutation of restricted quantifiers. |
| Ref | Expression |
|---|---|
| ralcom |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ancom 435 |
. . . . 5
| |
| 2 | 1 | imbi1i 186 |
. . . 4
|
| 3 | 2 | 2albii 1000 |
. . 3
|
| 4 | alcom 1032 |
. . 3
| |
| 5 | 3, 4 | bitr 173 |
. 2
|
| 6 | r2al 1676 |
. 2
| |
| 7 | r2al 1676 |
. 2
| |
| 8 | 5, 6, 7 | 3bitr4 183 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ralcom4 1823 ssint 2549 cnvpo 3522 cnvso 3523 fununi 3563 mapxpen 4495 cau3i 6914 fsumcom 7028 tgss3t 7638 basgen2t 7639 cncnp 7778 phoeqi 8518 occl 9181 ho02 9755 hoeq2t 9757 adjsymt 9759 cnvadj 9816 hhlno 9826 mddmd 10236 cdj3lem3b 10367 |
| 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-an 225 df-ral 1649 |