Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfra2xy | Unicode version |
Description: Not-free given two restricted quantifiers. (Contributed by Jim Kingdon, 20-Aug-2018.) |
Ref | Expression |
---|---|
nfra2xy |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2308 | . 2 | |
2 | nfra1 2497 | . 2 | |
3 | 1, 2 | nfralxy 2504 | 1 |
Colors of variables: wff set class |
Syntax hints: wnf 1448 wral 2444 |
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-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-4 1498 ax-17 1514 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-nf 1449 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 |
This theorem is referenced by: invdisj 3976 reusv3 4438 |
Copyright terms: Public domain | W3C validator |