Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ralcom4 | Unicode version |
Description: Commutation of restricted and unrestricted universal quantifiers. (Contributed by NM, 26-Mar-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) |
Ref | Expression |
---|---|
ralcom4 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralcom 2633 | . 2 | |
2 | ralv 2747 | . . 3 | |
3 | 2 | ralbii 2476 | . 2 |
4 | ralv 2747 | . 2 | |
5 | 1, 3, 4 | 3bitr3i 209 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 104 wal 1346 wral 2448 cvv 2730 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-v 2732 |
This theorem is referenced by: uniiunlem 3236 uni0b 3821 iunss 3914 disjnim 3980 trint 4102 reliun 4732 funimass4 5547 ralrnmpo 5967 |
Copyright terms: Public domain | W3C validator |