Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ralcom | Unicode version |
Description: Commutation of restricted quantifiers. (Contributed by NM, 13-Oct-1999.) (Revised by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
ralcom |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2281 | . 2 | |
2 | nfcv 2281 | . 2 | |
3 | 1, 2 | ralcomf 2592 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 104 wral 2416 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-sb 1736 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 |
This theorem is referenced by: ralcom4 2708 ssint 3787 issod 4241 reusv3 4381 cnvpom 5081 cnvsom 5082 fununi 5191 isocnv2 5713 dfsmo2 6184 ixpiinm 6618 rexfiuz 10761 tgss2 12248 cnmptcom 12467 |
Copyright terms: Public domain | W3C validator |