| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Commutation of restricted quantifiers. |
| Ref | Expression |
|---|---|
| ralcom |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ancom 333 |
. . . . 5
| |
| 2 | 1 | imbi1i 161 |
. . . 4
|
| 3 | 2 | bi2al 696 |
. . 3
|
| 4 | alcom 715 |
. . 3
| |
| 5 | 3, 4 | bitr 151 |
. 2
|
| 6 | r2al 1231 |
. 2
| |
| 7 | r2al 1231 |
. 2
| |
| 8 | 5, 6, 7 | 3bitr4 158 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ralcom4 1360 ssint 1980 fununi 2705 mapxpen 3390 occl 5188 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-17 925 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ral 1205 |