| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Rearrange restricted quantifiers. |
| Ref | Expression |
|---|---|
| raaan |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm5.1 501 |
. . 3
| |
| 2 | rzal 1773 |
. . 3
| |
| 3 | rzal 1773 |
. . . 4
| |
| 4 | rzal 1773 |
. . . 4
| |
| 5 | 3, 4 | jca 236 |
. . 3
|
| 6 | 1, 2, 5 | sylanc 361 |
. 2
|
| 7 | r19.3rzv 1767 |
. . . . . 6
| |
| 8 | 7 | anbi1d 469 |
. . . . 5
|
| 9 | r19.26 1289 |
. . . . 5
| |
| 10 | 8, 9 | syl6rbbr 417 |
. . . 4
|
| 11 | 10 | biraldv 1219 |
. . 3
|
| 12 | r19.3rzv 1767 |
. . . . 5
| |
| 13 | 12 | anbi2d 468 |
. . . 4
|
| 14 | r19.26 1289 |
. . . 4
| |
| 15 | 13, 14 | syl6rbbr 417 |
. . 3
|
| 16 | 11, 15 | bitrd 406 |
. 2
|
| 17 | 6, 16 | pm2.61i 110 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: hlimcaui 5141 |
| 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-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-ral 1205 df-v 1349 df-dif 1489 df-nul 1708 |