Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ralcomf | Structured version Visualization version Unicode version |
Description: Commutation of restricted universal quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
ralcomf.1 | |
ralcomf.2 |
Ref | Expression |
---|---|
ralcomf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ancomst 468 | . . . 4 | |
2 | 1 | 2albii 1748 | . . 3 |
3 | alcom 2037 | . . 3 | |
4 | 2, 3 | bitri 264 | . 2 |
5 | ralcomf.1 | . . 3 | |
6 | 5 | r2alf 2938 | . 2 |
7 | ralcomf.2 | . . 3 | |
8 | 7 | r2alf 2938 | . 2 |
9 | 4, 6, 8 | 3bitr4i 292 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wal 1481 wcel 1990 wnfc 2751 wral 2912 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 |
This theorem is referenced by: ralcom 3098 ssiinf 4569 ralcom4f 29316 |
Copyright terms: Public domain | W3C validator |